{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AG3UEZHLOCJO7LP6SY22S7X4GW","short_pith_number":"pith:AG3UEZHL","schema_version":"1.0","canonical_sha256":"01b74264eb7092efadfe9635a97efc35923508e9dbf924d01985a4e1b9745548","source":{"kind":"arxiv","id":"1907.09015","version":1},"attestation_state":"computed","paper":{"title":"A category for bijective combinatorics","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["math.CT","math.HO"],"primary_cat":"math.CO","authors_text":"Peter G. Doyle","submitted_at":"2019-07-21T18:14:48Z","abstract_excerpt":"The category of matchings between finite sets extends to the category of cobordisms of signed sets. A chain of cobordisms that starts and ends with unsigned sets A and B yields a matching from A to B. This is a convenient way to package the involution principle of Garsia and Milne, which reveals itself to have little to do with involutions."},"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":"1907.09015","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-21T18:14:48Z","cross_cats_sorted":["math.CT","math.HO"],"title_canon_sha256":"e69eb0f4deda6b2480b83b51f59c01071ed9a0b4910630c53e25da2bcd69a7bb","abstract_canon_sha256":"15f9bd29cb5ac758e6b09e60a34731f78a4e64f703481205350a0ed72ac0ed4d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:02.417068Z","signature_b64":"sKemjuWEheL+93fIv/gad5kgeJV14gfl1qDMKy3xXvMzV7tVvlDGObQxvDBqqUC/Bu+r4eUy+lXg3o4N9aXNBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01b74264eb7092efadfe9635a97efc35923508e9dbf924d01985a4e1b9745548","last_reissued_at":"2026-05-17T23:40:02.416515Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:02.416515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A category for bijective combinatorics","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["math.CT","math.HO"],"primary_cat":"math.CO","authors_text":"Peter G. Doyle","submitted_at":"2019-07-21T18:14:48Z","abstract_excerpt":"The category of matchings between finite sets extends to the category of cobordisms of signed sets. A chain of cobordisms that starts and ends with unsigned sets A and B yields a matching from A to B. This is a convenient way to package the involution principle of Garsia and Milne, which reveals itself to have little to do with involutions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09015","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":"1907.09015","created_at":"2026-05-17T23:40:02.416603+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.09015v1","created_at":"2026-05-17T23:40:02.416603+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09015","created_at":"2026-05-17T23:40:02.416603+00:00"},{"alias_kind":"pith_short_12","alias_value":"AG3UEZHLOCJO","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"AG3UEZHLOCJO7LP6","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"AG3UEZHL","created_at":"2026-05-18T12:33:12.712433+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/AG3UEZHLOCJO7LP6SY22S7X4GW","json":"https://pith.science/pith/AG3UEZHLOCJO7LP6SY22S7X4GW.json","graph_json":"https://pith.science/api/pith-number/AG3UEZHLOCJO7LP6SY22S7X4GW/graph.json","events_json":"https://pith.science/api/pith-number/AG3UEZHLOCJO7LP6SY22S7X4GW/events.json","paper":"https://pith.science/paper/AG3UEZHL"},"agent_actions":{"view_html":"https://pith.science/pith/AG3UEZHLOCJO7LP6SY22S7X4GW","download_json":"https://pith.science/pith/AG3UEZHLOCJO7LP6SY22S7X4GW.json","view_paper":"https://pith.science/paper/AG3UEZHL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.09015&json=true","fetch_graph":"https://pith.science/api/pith-number/AG3UEZHLOCJO7LP6SY22S7X4GW/graph.json","fetch_events":"https://pith.science/api/pith-number/AG3UEZHLOCJO7LP6SY22S7X4GW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AG3UEZHLOCJO7LP6SY22S7X4GW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AG3UEZHLOCJO7LP6SY22S7X4GW/action/storage_attestation","attest_author":"https://pith.science/pith/AG3UEZHLOCJO7LP6SY22S7X4GW/action/author_attestation","sign_citation":"https://pith.science/pith/AG3UEZHLOCJO7LP6SY22S7X4GW/action/citation_signature","submit_replication":"https://pith.science/pith/AG3UEZHLOCJO7LP6SY22S7X4GW/action/replication_record"}},"created_at":"2026-05-17T23:40:02.416603+00:00","updated_at":"2026-05-17T23:40:02.416603+00:00"}