{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:R3ZXS6NXFHBWQGMSKSXJHFU66A","short_pith_number":"pith:R3ZXS6NX","canonical_record":{"source":{"id":"1907.02574","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-04T20:14:55Z","cross_cats_sorted":["math.CT"],"title_canon_sha256":"1c9c60a49144346545eba9097306fecb287ee070893c1bc46f1659cc751a6772","abstract_canon_sha256":"8539cce671c654b0c22997164b6bf2e2714d8e8656a13af24f8309c6f190541a"},"schema_version":"1.0"},"canonical_sha256":"8ef37979b729c368199254ae93969ef012fcd138dc365bf9f43292152cf9bee1","source":{"kind":"arxiv","id":"1907.02574","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02574","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02574v1","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02574","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"pith_short_12","alias_value":"R3ZXS6NXFHBW","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"R3ZXS6NXFHBWQGMS","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"R3ZXS6NX","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:R3ZXS6NXFHBWQGMSKSXJHFU66A","target":"record","payload":{"canonical_record":{"source":{"id":"1907.02574","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-04T20:14:55Z","cross_cats_sorted":["math.CT"],"title_canon_sha256":"1c9c60a49144346545eba9097306fecb287ee070893c1bc46f1659cc751a6772","abstract_canon_sha256":"8539cce671c654b0c22997164b6bf2e2714d8e8656a13af24f8309c6f190541a"},"schema_version":"1.0"},"canonical_sha256":"8ef37979b729c368199254ae93969ef012fcd138dc365bf9f43292152cf9bee1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:23.913659Z","signature_b64":"E1G9LOjZigP7fsdwNoI4+2PnW5HnmGY5UfidOU0Jbzvvrrn4DvyRIOEnOWeteURcD+PTgEprY7O0i0XwpIUSDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ef37979b729c368199254ae93969ef012fcd138dc365bf9f43292152cf9bee1","last_reissued_at":"2026-05-17T23:41:23.912899Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:23.912899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.02574","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:41:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ve8vpVE2HI4ewrLzvqAWGeDzuEI9Q/YUbCO2dtHI3oouGQJC2pXYKo5fetSPVLJUKcLVIQCtvzk6gjUREw0GAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:04:42.177621Z"},"content_sha256":"9b151ac774b5b00bd027e5ffea2ff5ad0a2ead90cc365940f9b12178cbc2a280","schema_version":"1.0","event_id":"sha256:9b151ac774b5b00bd027e5ffea2ff5ad0a2ead90cc365940f9b12178cbc2a280"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:R3ZXS6NXFHBWQGMSKSXJHFU66A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Functorial Approach to Graph and Hypergraph Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CT"],"primary_cat":"math.CO","authors_text":"Martin Schmidt","submitted_at":"2019-07-04T20:14:55Z","abstract_excerpt":"We provide a new approach to categorical graph and hypergraph theory by using categorical syntax and semantics. For each monoid $M$ and action on a set $X$, there is an associated presheaf topos of $(X,M)$-graphs where each object can be interpreted as a generalized uniform hypergraph where each edge has cardinality $\\#X$ incident vertices (including multiplicity) and where the monoid informs what type of cohesivity the edges possess. One distinguishing feature of $(X,M)$-graphs is the presence of unfixed edges. We prove that unfixed edges are a necessary feature of a category of graphs or uni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02574","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:41:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MeMdh28bVf6022Rq4RdboVPTlCMCYupuNecEajfCe1ANgzmB2kEyeHv/Nb1rHPx5Lv6KI7BcPRKZH/iI5dyvCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:04:42.177963Z"},"content_sha256":"102f0356b9f6607335b1ca9e316e7815479f1c4f6a7aa9b3b7c032e2601368c2","schema_version":"1.0","event_id":"sha256:102f0356b9f6607335b1ca9e316e7815479f1c4f6a7aa9b3b7c032e2601368c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R3ZXS6NXFHBWQGMSKSXJHFU66A/bundle.json","state_url":"https://pith.science/pith/R3ZXS6NXFHBWQGMSKSXJHFU66A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R3ZXS6NXFHBWQGMSKSXJHFU66A/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T14:04:42Z","links":{"resolver":"https://pith.science/pith/R3ZXS6NXFHBWQGMSKSXJHFU66A","bundle":"https://pith.science/pith/R3ZXS6NXFHBWQGMSKSXJHFU66A/bundle.json","state":"https://pith.science/pith/R3ZXS6NXFHBWQGMSKSXJHFU66A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R3ZXS6NXFHBWQGMSKSXJHFU66A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:R3ZXS6NXFHBWQGMSKSXJHFU66A","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8539cce671c654b0c22997164b6bf2e2714d8e8656a13af24f8309c6f190541a","cross_cats_sorted":["math.CT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-04T20:14:55Z","title_canon_sha256":"1c9c60a49144346545eba9097306fecb287ee070893c1bc46f1659cc751a6772"},"schema_version":"1.0","source":{"id":"1907.02574","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02574","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02574v1","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02574","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"pith_short_12","alias_value":"R3ZXS6NXFHBW","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"R3ZXS6NXFHBWQGMS","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"R3ZXS6NX","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:102f0356b9f6607335b1ca9e316e7815479f1c4f6a7aa9b3b7c032e2601368c2","target":"graph","created_at":"2026-05-17T23:41:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We provide a new approach to categorical graph and hypergraph theory by using categorical syntax and semantics. For each monoid $M$ and action on a set $X$, there is an associated presheaf topos of $(X,M)$-graphs where each object can be interpreted as a generalized uniform hypergraph where each edge has cardinality $\\#X$ incident vertices (including multiplicity) and where the monoid informs what type of cohesivity the edges possess. One distinguishing feature of $(X,M)$-graphs is the presence of unfixed edges. We prove that unfixed edges are a necessary feature of a category of graphs or uni","authors_text":"Martin Schmidt","cross_cats":["math.CT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-04T20:14:55Z","title":"Functorial Approach to Graph and Hypergraph Theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02574","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9b151ac774b5b00bd027e5ffea2ff5ad0a2ead90cc365940f9b12178cbc2a280","target":"record","created_at":"2026-05-17T23:41:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8539cce671c654b0c22997164b6bf2e2714d8e8656a13af24f8309c6f190541a","cross_cats_sorted":["math.CT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-04T20:14:55Z","title_canon_sha256":"1c9c60a49144346545eba9097306fecb287ee070893c1bc46f1659cc751a6772"},"schema_version":"1.0","source":{"id":"1907.02574","kind":"arxiv","version":1}},"canonical_sha256":"8ef37979b729c368199254ae93969ef012fcd138dc365bf9f43292152cf9bee1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ef37979b729c368199254ae93969ef012fcd138dc365bf9f43292152cf9bee1","first_computed_at":"2026-05-17T23:41:23.912899Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:23.912899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E1G9LOjZigP7fsdwNoI4+2PnW5HnmGY5UfidOU0Jbzvvrrn4DvyRIOEnOWeteURcD+PTgEprY7O0i0XwpIUSDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:23.913659Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.02574","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b151ac774b5b00bd027e5ffea2ff5ad0a2ead90cc365940f9b12178cbc2a280","sha256:102f0356b9f6607335b1ca9e316e7815479f1c4f6a7aa9b3b7c032e2601368c2"],"state_sha256":"ed9165a1b9aabaaf8fd875c4a09f39a8da76ffab2e3afd8645607082d4fa96cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"udn6ruAkK8+28BugPaY77XqO8xqhImCllGnB2yleAXiamKjrGYXne+Ube/8FWddQlRsTpP2On5tq3pcCckaWCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T14:04:42.180074Z","bundle_sha256":"dd7874850d43e6813aa5b796ee67d33c73d8646eb03c584d60fbddbdb9cdbb73"}}