{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:RYV6LWOMOQTQ5XH342K5UPMYGL","short_pith_number":"pith:RYV6LWOM","canonical_record":{"source":{"id":"2607.23778","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-07-26T17:56:44Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"13d7592a746221da49fbe6e8a386446699f7ab152062d97f73c9b2cb623daa45","abstract_canon_sha256":"d1ac45ee1d35d5ed32f0e91a73b2ac46cf385ccd573d2fa8e311c3a27917c65b"},"schema_version":"1.0"},"canonical_sha256":"8e2be5d9cc74270edcfbe695da3d9832cbd4047afbe0a0cb721d07ebca627f00","source":{"kind":"arxiv","id":"2607.23778","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.23778","created_at":"2026-07-28T01:23:10Z"},{"alias_kind":"arxiv_version","alias_value":"2607.23778v1","created_at":"2026-07-28T01:23:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.23778","created_at":"2026-07-28T01:23:10Z"},{"alias_kind":"pith_short_12","alias_value":"RYV6LWOMOQTQ","created_at":"2026-07-28T01:23:10Z"},{"alias_kind":"pith_short_16","alias_value":"RYV6LWOMOQTQ5XH3","created_at":"2026-07-28T01:23:10Z"},{"alias_kind":"pith_short_8","alias_value":"RYV6LWOM","created_at":"2026-07-28T01:23:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:RYV6LWOMOQTQ5XH342K5UPMYGL","target":"record","payload":{"canonical_record":{"source":{"id":"2607.23778","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-07-26T17:56:44Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"13d7592a746221da49fbe6e8a386446699f7ab152062d97f73c9b2cb623daa45","abstract_canon_sha256":"d1ac45ee1d35d5ed32f0e91a73b2ac46cf385ccd573d2fa8e311c3a27917c65b"},"schema_version":"1.0"},"canonical_sha256":"8e2be5d9cc74270edcfbe695da3d9832cbd4047afbe0a0cb721d07ebca627f00","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-28T01:23:10.676271Z","signature_b64":"+6i9qbtlm2u5xDadCeTsMm0+/I+zQqm+9Epc7NpZUuo5rE1+BoXMMetV72JQb8mKwPSDBlYwEljTAS/bfk4gBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e2be5d9cc74270edcfbe695da3d9832cbd4047afbe0a0cb721d07ebca627f00","last_reissued_at":"2026-07-28T01:23:10.675440Z","signature_status":"signed_v1","first_computed_at":"2026-07-28T01:23:10.675440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.23778","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-07-28T01:23:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fa7pNDBJBlG/CtYQvN2z07vUyiMye1JnIiQ530B9W2CJGDouVCeag5g9epcPqjRkavx///JqIViCxy3DGcdyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T04:40:14.245985Z"},"content_sha256":"b0192269d72edeba270dff30e8f74d15237acf3b098baec1517ef378ba32578b","schema_version":"1.0","event_id":"sha256:b0192269d72edeba270dff30e8f74d15237acf3b098baec1517ef378ba32578b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:RYV6LWOMOQTQ5XH342K5UPMYGL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stability in stochastic hypergraph matching I: necessary and sufficient criteria","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.DM","authors_text":"Ana Bu\\v{s}i\\'c, Doan Dai Nguyen","submitted_at":"2026-07-26T17:56:44Z","abstract_excerpt":"Stochastic matching on hypergraphs is an important topic for its versatility in capturing real-life systems, from living donor transplant to ride-hailing. Nevertheless, finding necessary and sufficient criteria for stability is a long-standing problem. One of the key difficulties is the fact that greedy policies, whilst maximally stable for stochastic matching on graphs, no longer achieve maximal stability region on hypergraphs. So far, no alternative families of policies with similar properties have been known.\n  In this work, we introduce online assignment policies, in which each item is ass"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.23778","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/2607.23778/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-28T01:23:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Y3AP6Yr/gR0w+qFYqMVNX24aeI39ImxB4cOwvNAJdeu+6JPGKBE8kdWwLTSAGpZ9ypIJAneIdOtpZVn9dmWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T04:40:14.246652Z"},"content_sha256":"0d462be45129e9242cac4e6356350ef4273a1080ec9fdb67b8e309f3d0ea2fba","schema_version":"1.0","event_id":"sha256:0d462be45129e9242cac4e6356350ef4273a1080ec9fdb67b8e309f3d0ea2fba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RYV6LWOMOQTQ5XH342K5UPMYGL/bundle.json","state_url":"https://pith.science/pith/RYV6LWOMOQTQ5XH342K5UPMYGL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RYV6LWOMOQTQ5XH342K5UPMYGL/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-08-15T04:40:14Z","links":{"resolver":"https://pith.science/pith/RYV6LWOMOQTQ5XH342K5UPMYGL","bundle":"https://pith.science/pith/RYV6LWOMOQTQ5XH342K5UPMYGL/bundle.json","state":"https://pith.science/pith/RYV6LWOMOQTQ5XH342K5UPMYGL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RYV6LWOMOQTQ5XH342K5UPMYGL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:RYV6LWOMOQTQ5XH342K5UPMYGL","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":"d1ac45ee1d35d5ed32f0e91a73b2ac46cf385ccd573d2fa8e311c3a27917c65b","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-07-26T17:56:44Z","title_canon_sha256":"13d7592a746221da49fbe6e8a386446699f7ab152062d97f73c9b2cb623daa45"},"schema_version":"1.0","source":{"id":"2607.23778","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.23778","created_at":"2026-07-28T01:23:10Z"},{"alias_kind":"arxiv_version","alias_value":"2607.23778v1","created_at":"2026-07-28T01:23:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.23778","created_at":"2026-07-28T01:23:10Z"},{"alias_kind":"pith_short_12","alias_value":"RYV6LWOMOQTQ","created_at":"2026-07-28T01:23:10Z"},{"alias_kind":"pith_short_16","alias_value":"RYV6LWOMOQTQ5XH3","created_at":"2026-07-28T01:23:10Z"},{"alias_kind":"pith_short_8","alias_value":"RYV6LWOM","created_at":"2026-07-28T01:23:10Z"}],"graph_snapshots":[{"event_id":"sha256:0d462be45129e9242cac4e6356350ef4273a1080ec9fdb67b8e309f3d0ea2fba","target":"graph","created_at":"2026-07-28T01:23:10Z","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":[],"endpoint":"/pith/2607.23778/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Stochastic matching on hypergraphs is an important topic for its versatility in capturing real-life systems, from living donor transplant to ride-hailing. Nevertheless, finding necessary and sufficient criteria for stability is a long-standing problem. One of the key difficulties is the fact that greedy policies, whilst maximally stable for stochastic matching on graphs, no longer achieve maximal stability region on hypergraphs. So far, no alternative families of policies with similar properties have been known.\n  In this work, we introduce online assignment policies, in which each item is ass","authors_text":"Ana Bu\\v{s}i\\'c, Doan Dai Nguyen","cross_cats":["math.PR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-07-26T17:56:44Z","title":"Stability in stochastic hypergraph matching I: necessary and sufficient criteria"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.23778","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:b0192269d72edeba270dff30e8f74d15237acf3b098baec1517ef378ba32578b","target":"record","created_at":"2026-07-28T01:23:10Z","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":"d1ac45ee1d35d5ed32f0e91a73b2ac46cf385ccd573d2fa8e311c3a27917c65b","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-07-26T17:56:44Z","title_canon_sha256":"13d7592a746221da49fbe6e8a386446699f7ab152062d97f73c9b2cb623daa45"},"schema_version":"1.0","source":{"id":"2607.23778","kind":"arxiv","version":1}},"canonical_sha256":"8e2be5d9cc74270edcfbe695da3d9832cbd4047afbe0a0cb721d07ebca627f00","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e2be5d9cc74270edcfbe695da3d9832cbd4047afbe0a0cb721d07ebca627f00","first_computed_at":"2026-07-28T01:23:10.675440Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-28T01:23:10.675440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+6i9qbtlm2u5xDadCeTsMm0+/I+zQqm+9Epc7NpZUuo5rE1+BoXMMetV72JQb8mKwPSDBlYwEljTAS/bfk4gBg==","signature_status":"signed_v1","signed_at":"2026-07-28T01:23:10.676271Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.23778","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0192269d72edeba270dff30e8f74d15237acf3b098baec1517ef378ba32578b","sha256:0d462be45129e9242cac4e6356350ef4273a1080ec9fdb67b8e309f3d0ea2fba"],"state_sha256":"2183afb7fa98251a6287cbdacdc5c6874324bfdc3111479d4afbacddfb800750"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j7TG5pKHxpWdX5QSp725JxoY9YgyOZQ3veqciqdiIrusyrjAxsBi9YTEAHsCLo9H3bpkOCqeoT+X23rPXwj1Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T04:40:14.252129Z","bundle_sha256":"8f213db1f613afe4f3ba7637c6f4e2cde597fb1a8f5d5d684253326f669cdabb"}}