{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:SGOCFXWEMODC3BPDFTQCFJFWKJ","short_pith_number":"pith:SGOCFXWE","schema_version":"1.0","canonical_sha256":"919c22dec463862d85e32ce022a4b6524b2c85780487361e04d0835df7bf9f9e","source":{"kind":"arxiv","id":"1210.5650","version":1},"attestation_state":"computed","paper":{"title":"On semisimplicial sets satisfying the Kan condition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GT"],"primary_cat":"math.AT","authors_text":"James E. McClure","submitted_at":"2012-10-20T19:42:34Z","abstract_excerpt":"A semisimplicial set has face maps but not degeneracies. A basic fact, due to Rourke and Sanderson, is that a semisimplicial set satisfying the Kan condition can be given a simplicial structure. The present paper gives a combinatorial proof of this fact and a generalization to multisemisimplicial sets."},"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":"1210.5650","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2012-10-20T19:42:34Z","cross_cats_sorted":["math.GT"],"title_canon_sha256":"75d586fb61b07f3d70dea05dceb731a7e3c0318ebff577a428f66ea0b048cb80","abstract_canon_sha256":"ba64eefabd2a53b12e2066b7e6982b5509ba05f1d2b4231538434505320e8d29"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:43.439864Z","signature_b64":"bcg7UMBDoNt9Jj5ENbwbTthyf9Hw3koDBkh0fB+ah4hsXcVEEP/EhloExgISfJCmKhI5nN/PvHHoIuMrQIlWCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"919c22dec463862d85e32ce022a4b6524b2c85780487361e04d0835df7bf9f9e","last_reissued_at":"2026-05-18T03:42:43.439213Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:43.439213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On semisimplicial sets satisfying the Kan condition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GT"],"primary_cat":"math.AT","authors_text":"James E. McClure","submitted_at":"2012-10-20T19:42:34Z","abstract_excerpt":"A semisimplicial set has face maps but not degeneracies. A basic fact, due to Rourke and Sanderson, is that a semisimplicial set satisfying the Kan condition can be given a simplicial structure. The present paper gives a combinatorial proof of this fact and a generalization to multisemisimplicial sets."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.5650","kind":"arxiv","version":1},"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":"1210.5650","created_at":"2026-05-18T03:42:43.439325+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.5650v1","created_at":"2026-05-18T03:42:43.439325+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.5650","created_at":"2026-05-18T03:42:43.439325+00:00"},{"alias_kind":"pith_short_12","alias_value":"SGOCFXWEMODC","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"SGOCFXWEMODC3BPD","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"SGOCFXWE","created_at":"2026-05-18T12:27:20.899486+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.10695","citing_title":"A Simplicial Approach to Higher Geometric Quantization","ref_index":24,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SGOCFXWEMODC3BPDFTQCFJFWKJ","json":"https://pith.science/pith/SGOCFXWEMODC3BPDFTQCFJFWKJ.json","graph_json":"https://pith.science/api/pith-number/SGOCFXWEMODC3BPDFTQCFJFWKJ/graph.json","events_json":"https://pith.science/api/pith-number/SGOCFXWEMODC3BPDFTQCFJFWKJ/events.json","paper":"https://pith.science/paper/SGOCFXWE"},"agent_actions":{"view_html":"https://pith.science/pith/SGOCFXWEMODC3BPDFTQCFJFWKJ","download_json":"https://pith.science/pith/SGOCFXWEMODC3BPDFTQCFJFWKJ.json","view_paper":"https://pith.science/paper/SGOCFXWE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.5650&json=true","fetch_graph":"https://pith.science/api/pith-number/SGOCFXWEMODC3BPDFTQCFJFWKJ/graph.json","fetch_events":"https://pith.science/api/pith-number/SGOCFXWEMODC3BPDFTQCFJFWKJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SGOCFXWEMODC3BPDFTQCFJFWKJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SGOCFXWEMODC3BPDFTQCFJFWKJ/action/storage_attestation","attest_author":"https://pith.science/pith/SGOCFXWEMODC3BPDFTQCFJFWKJ/action/author_attestation","sign_citation":"https://pith.science/pith/SGOCFXWEMODC3BPDFTQCFJFWKJ/action/citation_signature","submit_replication":"https://pith.science/pith/SGOCFXWEMODC3BPDFTQCFJFWKJ/action/replication_record"}},"created_at":"2026-05-18T03:42:43.439325+00:00","updated_at":"2026-05-18T03:42:43.439325+00:00"}