{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:HUJQKACR5SWNKPLHIXIZZ3AXAX","short_pith_number":"pith:HUJQKACR","canonical_record":{"source":{"id":"2605.16028","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-15T15:04:31Z","cross_cats_sorted":[],"title_canon_sha256":"ae9cac58f8170c344cecb10b7050dafd068a5bc0e421a3bedb55b12f88c2f570","abstract_canon_sha256":"7dc52521bb98772a2dd6e02e178ebfaf34036e6c10827b9bed872ea0bd3c47b6"},"schema_version":"1.0"},"canonical_sha256":"3d13050051ecacd53d6745d19cec1705c82942c07eb754813012b716c3387e25","source":{"kind":"arxiv","id":"2605.16028","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16028","created_at":"2026-05-20T00:01:49Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16028v1","created_at":"2026-05-20T00:01:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16028","created_at":"2026-05-20T00:01:49Z"},{"alias_kind":"pith_short_12","alias_value":"HUJQKACR5SWN","created_at":"2026-05-20T00:01:49Z"},{"alias_kind":"pith_short_16","alias_value":"HUJQKACR5SWNKPLH","created_at":"2026-05-20T00:01:49Z"},{"alias_kind":"pith_short_8","alias_value":"HUJQKACR","created_at":"2026-05-20T00:01:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:HUJQKACR5SWNKPLHIXIZZ3AXAX","target":"record","payload":{"canonical_record":{"source":{"id":"2605.16028","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-15T15:04:31Z","cross_cats_sorted":[],"title_canon_sha256":"ae9cac58f8170c344cecb10b7050dafd068a5bc0e421a3bedb55b12f88c2f570","abstract_canon_sha256":"7dc52521bb98772a2dd6e02e178ebfaf34036e6c10827b9bed872ea0bd3c47b6"},"schema_version":"1.0"},"canonical_sha256":"3d13050051ecacd53d6745d19cec1705c82942c07eb754813012b716c3387e25","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:49.880076Z","signature_b64":"Z3mScVWHgWFJ0CgfzAgPs8vJwNGmkxHg+5jG8lUTLmUDn+noY7Xqz5ZdTG6TbL7/CUTf4D4CCAL6wjfi4AE/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d13050051ecacd53d6745d19cec1705c82942c07eb754813012b716c3387e25","last_reissued_at":"2026-05-20T00:01:49.879579Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:49.879579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.16028","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-20T00:01:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IyTwHa0nkCrO54Tf95if54BcVL1LDG+MaewZEI4R8Ed10nQyKjQOQYV6qAaAoewVt3DrecmabvfhxiSR7xHEAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:44:18.904402Z"},"content_sha256":"2fadfc02835cd9db39ffb0b5440bfa04d407a2f8f1a76c06134715ab30221015","schema_version":"1.0","event_id":"sha256:2fadfc02835cd9db39ffb0b5440bfa04d407a2f8f1a76c06134715ab30221015"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:HUJQKACR5SWNKPLHIXIZZ3AXAX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subgraphs versus Orientations: Infinite families of equidistributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jonathan J. Fang, Oliver Bernardi","submitted_at":"2026-05-15T15:04:31Z","abstract_excerpt":"A classical enumerative result states that, given a graph $G$ and a vertex $u$, the number of connected subgraphs of $G$ is equal to the number of orientations of $G$ such that every vertex can reach $u$ by a directed path. We show that this result is an instance of a much broader set of enumerative identities between subgraphs and orientations corresponding to various connectivity constraints. Namely, given two sets of pairs of vertices $A=\\{(u_i,v_i), i\\in[k]\\}$ and $B=\\{(u_i',v_i'), i\\in[l]\\}$, we consider the orientations $\\alpha$ of $G$ such that adding the elements of $A$ and $B$ as addi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.16028","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16028/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:42.152842Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T16:41:55.545473Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"bea7fb3be175c7d193845380d22c9ea1445b1f38294038f772a22ed37c6f2f53"},"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-20T00:01:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7y0JXpTPfJHpL8wHQdkZ6Bmk9iJkXYyTPRfqB7QHlRgecNZzBbs6ik+c314bpqPWzf+kEno0A640PWqvrNq9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:44:18.904822Z"},"content_sha256":"938f3b36c6d1ef944af2b1aa002597524ce2ee423d9acb65f5c52aa326a77097","schema_version":"1.0","event_id":"sha256:938f3b36c6d1ef944af2b1aa002597524ce2ee423d9acb65f5c52aa326a77097"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HUJQKACR5SWNKPLHIXIZZ3AXAX/bundle.json","state_url":"https://pith.science/pith/HUJQKACR5SWNKPLHIXIZZ3AXAX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HUJQKACR5SWNKPLHIXIZZ3AXAX/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-24T07:44:18Z","links":{"resolver":"https://pith.science/pith/HUJQKACR5SWNKPLHIXIZZ3AXAX","bundle":"https://pith.science/pith/HUJQKACR5SWNKPLHIXIZZ3AXAX/bundle.json","state":"https://pith.science/pith/HUJQKACR5SWNKPLHIXIZZ3AXAX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HUJQKACR5SWNKPLHIXIZZ3AXAX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:HUJQKACR5SWNKPLHIXIZZ3AXAX","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":"7dc52521bb98772a2dd6e02e178ebfaf34036e6c10827b9bed872ea0bd3c47b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-15T15:04:31Z","title_canon_sha256":"ae9cac58f8170c344cecb10b7050dafd068a5bc0e421a3bedb55b12f88c2f570"},"schema_version":"1.0","source":{"id":"2605.16028","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16028","created_at":"2026-05-20T00:01:49Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16028v1","created_at":"2026-05-20T00:01:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16028","created_at":"2026-05-20T00:01:49Z"},{"alias_kind":"pith_short_12","alias_value":"HUJQKACR5SWN","created_at":"2026-05-20T00:01:49Z"},{"alias_kind":"pith_short_16","alias_value":"HUJQKACR5SWNKPLH","created_at":"2026-05-20T00:01:49Z"},{"alias_kind":"pith_short_8","alias_value":"HUJQKACR","created_at":"2026-05-20T00:01:49Z"}],"graph_snapshots":[{"event_id":"sha256:938f3b36c6d1ef944af2b1aa002597524ce2ee423d9acb65f5c52aa326a77097","target":"graph","created_at":"2026-05-20T00:01:49Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:42.152842Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T16:41:55.545473Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.16028/integrity.json","findings":[],"snapshot_sha256":"bea7fb3be175c7d193845380d22c9ea1445b1f38294038f772a22ed37c6f2f53","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A classical enumerative result states that, given a graph $G$ and a vertex $u$, the number of connected subgraphs of $G$ is equal to the number of orientations of $G$ such that every vertex can reach $u$ by a directed path. We show that this result is an instance of a much broader set of enumerative identities between subgraphs and orientations corresponding to various connectivity constraints. Namely, given two sets of pairs of vertices $A=\\{(u_i,v_i), i\\in[k]\\}$ and $B=\\{(u_i',v_i'), i\\in[l]\\}$, we consider the orientations $\\alpha$ of $G$ such that adding the elements of $A$ and $B$ as addi","authors_text":"Jonathan J. Fang, Oliver Bernardi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-15T15:04:31Z","title":"Subgraphs versus Orientations: Infinite families of equidistributions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.16028","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:2fadfc02835cd9db39ffb0b5440bfa04d407a2f8f1a76c06134715ab30221015","target":"record","created_at":"2026-05-20T00:01:49Z","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":"7dc52521bb98772a2dd6e02e178ebfaf34036e6c10827b9bed872ea0bd3c47b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-15T15:04:31Z","title_canon_sha256":"ae9cac58f8170c344cecb10b7050dafd068a5bc0e421a3bedb55b12f88c2f570"},"schema_version":"1.0","source":{"id":"2605.16028","kind":"arxiv","version":1}},"canonical_sha256":"3d13050051ecacd53d6745d19cec1705c82942c07eb754813012b716c3387e25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d13050051ecacd53d6745d19cec1705c82942c07eb754813012b716c3387e25","first_computed_at":"2026-05-20T00:01:49.879579Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:49.879579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z3mScVWHgWFJ0CgfzAgPs8vJwNGmkxHg+5jG8lUTLmUDn+noY7Xqz5ZdTG6TbL7/CUTf4D4CCAL6wjfi4AE/AQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:49.880076Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16028","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2fadfc02835cd9db39ffb0b5440bfa04d407a2f8f1a76c06134715ab30221015","sha256:938f3b36c6d1ef944af2b1aa002597524ce2ee423d9acb65f5c52aa326a77097"],"state_sha256":"b224df64b372c070afa71b55bb9cebfd4662b9c8fbfff442614eb4bc7dc0243f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7ZUwFvHNO7JLYMb/gZ/7GSfQmpz5rdXwddQlLd7ZLnL/NC2d1P48nkgmSrvhMYN9IZzPY9KK/nLu0LQa9opXDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T07:44:18.906954Z","bundle_sha256":"bde71cdaa39d9f0308d7e8a6017afc6905217936c2ebd68e2600bc6eea863164"}}