{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:YPUSU3CD3ERL3FUTLRSPQTKNPS","short_pith_number":"pith:YPUSU3CD","schema_version":"1.0","canonical_sha256":"c3e92a6c43d922bd96935c64f84d4d7cbad20ebf1604495c9b8f94eb07e90c24","source":{"kind":"arxiv","id":"1903.03960","version":2},"attestation_state":"computed","paper":{"title":"Representability theorems, up to homotopy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CT"],"primary_cat":"math.AT","authors_text":"Boris Chorny, David Blanc","submitted_at":"2019-03-10T09:45:57Z","abstract_excerpt":"We prove two representability theorems, up to homotopy, for presheaves taking values in a closed symmetric combinatorial model category \\cat V. The first theorem resembles the Freyd representability theorem, the second theorem is closer to the Brown representability theorem. As an application we discuss a recognition principle for mapping spaces."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1903.03960","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2019-03-10T09:45:57Z","cross_cats_sorted":["math.CT"],"title_canon_sha256":"6e64fb338241843aeda0dc15c797c9fff0909aef100e72fa1adcea797a968c08","abstract_canon_sha256":"a833c65a4cd713a1892c79a3333d8f81664f3b0e702876207fde5161c411df6c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:39.724437Z","signature_b64":"rveWjLUYSfiL/b48hvqC5l/uY1c1jIK9PeHKoX7wzq6Yif6+gAcaFixI8Gz4syiegjcofVxclPCeR2lhUxOxAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3e92a6c43d922bd96935c64f84d4d7cbad20ebf1604495c9b8f94eb07e90c24","last_reissued_at":"2026-05-17T23:39:39.723861Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:39.723861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Representability theorems, up to homotopy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CT"],"primary_cat":"math.AT","authors_text":"Boris Chorny, David Blanc","submitted_at":"2019-03-10T09:45:57Z","abstract_excerpt":"We prove two representability theorems, up to homotopy, for presheaves taking values in a closed symmetric combinatorial model category \\cat V. The first theorem resembles the Freyd representability theorem, the second theorem is closer to the Brown representability theorem. As an application we discuss a recognition principle for mapping spaces."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03960","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.03960","created_at":"2026-05-17T23:39:39.723956+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.03960v2","created_at":"2026-05-17T23:39:39.723956+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03960","created_at":"2026-05-17T23:39:39.723956+00:00"},{"alias_kind":"pith_short_12","alias_value":"YPUSU3CD3ERL","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"YPUSU3CD3ERL3FUT","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"YPUSU3CD","created_at":"2026-05-18T12:33:33.725879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YPUSU3CD3ERL3FUTLRSPQTKNPS","json":"https://pith.science/pith/YPUSU3CD3ERL3FUTLRSPQTKNPS.json","graph_json":"https://pith.science/api/pith-number/YPUSU3CD3ERL3FUTLRSPQTKNPS/graph.json","events_json":"https://pith.science/api/pith-number/YPUSU3CD3ERL3FUTLRSPQTKNPS/events.json","paper":"https://pith.science/paper/YPUSU3CD"},"agent_actions":{"view_html":"https://pith.science/pith/YPUSU3CD3ERL3FUTLRSPQTKNPS","download_json":"https://pith.science/pith/YPUSU3CD3ERL3FUTLRSPQTKNPS.json","view_paper":"https://pith.science/paper/YPUSU3CD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.03960&json=true","fetch_graph":"https://pith.science/api/pith-number/YPUSU3CD3ERL3FUTLRSPQTKNPS/graph.json","fetch_events":"https://pith.science/api/pith-number/YPUSU3CD3ERL3FUTLRSPQTKNPS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YPUSU3CD3ERL3FUTLRSPQTKNPS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YPUSU3CD3ERL3FUTLRSPQTKNPS/action/storage_attestation","attest_author":"https://pith.science/pith/YPUSU3CD3ERL3FUTLRSPQTKNPS/action/author_attestation","sign_citation":"https://pith.science/pith/YPUSU3CD3ERL3FUTLRSPQTKNPS/action/citation_signature","submit_replication":"https://pith.science/pith/YPUSU3CD3ERL3FUTLRSPQTKNPS/action/replication_record"}},"created_at":"2026-05-17T23:39:39.723956+00:00","updated_at":"2026-05-17T23:39:39.723956+00:00"}