{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RFFGCJNLYXXUGSL3PBEXLELLAL","short_pith_number":"pith:RFFGCJNL","canonical_record":{"source":{"id":"1503.05812","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-19T15:55:36Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"4f8d865273231b5931a4e71217320ab7330cf69e8325f389ce5ce045c1b9d4b7","abstract_canon_sha256":"a7e3d059bd8d05b6da4380fd77fc04789432749a22c9f804360cc02d4bb3564a"},"schema_version":"1.0"},"canonical_sha256":"894a6125abc5ef43497b784975916b02e6771cb32a5122187bfe96a11addcd13","source":{"kind":"arxiv","id":"1503.05812","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.05812","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"arxiv_version","alias_value":"1503.05812v3","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.05812","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"pith_short_12","alias_value":"RFFGCJNLYXXU","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RFFGCJNLYXXUGSL3","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RFFGCJNL","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RFFGCJNLYXXUGSL3PBEXLELLAL","target":"record","payload":{"canonical_record":{"source":{"id":"1503.05812","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-19T15:55:36Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"4f8d865273231b5931a4e71217320ab7330cf69e8325f389ce5ce045c1b9d4b7","abstract_canon_sha256":"a7e3d059bd8d05b6da4380fd77fc04789432749a22c9f804360cc02d4bb3564a"},"schema_version":"1.0"},"canonical_sha256":"894a6125abc5ef43497b784975916b02e6771cb32a5122187bfe96a11addcd13","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:17.834755Z","signature_b64":"WpLwc3Qw3OZAWR6vZOJmh3hWG9LVj54ca2UMjj6wdvD5cCooReYLclqEqw92SiR2XnS6MvnurhZxq7nePK2mBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"894a6125abc5ef43497b784975916b02e6771cb32a5122187bfe96a11addcd13","last_reissued_at":"2026-05-18T00:53:17.834222Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:17.834222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.05812","source_version":3,"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-18T00:53:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TTQ+X3ilMDCR2yWfuYQ9x6WVx0ZO8iOlCgFUmHZSLaQutmvqsvxZh8HVWhB3RV2VDkiyeQOwp1oh467oYeIUBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:07:05.560860Z"},"content_sha256":"7307e1c7762a38c2ca9e8c76e7f23adaf368a5ed20008fcde5647438975a524d","schema_version":"1.0","event_id":"sha256:7307e1c7762a38c2ca9e8c76e7f23adaf368a5ed20008fcde5647438975a524d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RFFGCJNLYXXUGSL3PBEXLELLAL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting hypergraph matchings up to uniqueness threshold","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Jinman Zhao, Renjie Song, Yitong Yin","submitted_at":"2015-03-19T15:55:36Z","abstract_excerpt":"We study the problem of approximately counting matchings in hypergraphs of bounded maximum degree and maximum size of hyperedges. With an activity parameter $\\lambda$, each matching $M$ is assigned a weight $\\lambda^{|M|}$. The counting problem is formulated as computing a partition function that gives the sum of the weights of all matchings in a hypergraph. This problem unifies two extensively studied statistical physics models in approximate counting: the hardcore model (graph independent sets) and the monomer-dimer model (graph matchings).\n  For this model, the critical activity $\\lambda_c="},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.05812","kind":"arxiv","version":3},"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-18T00:53:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WMn76k4shMfpU0/ZAFfi80UTkmeIUC/9DJuOQ5DQ5l/9kH58Vym2/jNhXgF77fZMa422oFW+jVVyyYVmEuljDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:07:05.561209Z"},"content_sha256":"34de62cd586b98fddb5f34796e6982115c47f0933238c41cf79028b307a1e429","schema_version":"1.0","event_id":"sha256:34de62cd586b98fddb5f34796e6982115c47f0933238c41cf79028b307a1e429"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RFFGCJNLYXXUGSL3PBEXLELLAL/bundle.json","state_url":"https://pith.science/pith/RFFGCJNLYXXUGSL3PBEXLELLAL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RFFGCJNLYXXUGSL3PBEXLELLAL/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-05-28T08:07:05Z","links":{"resolver":"https://pith.science/pith/RFFGCJNLYXXUGSL3PBEXLELLAL","bundle":"https://pith.science/pith/RFFGCJNLYXXUGSL3PBEXLELLAL/bundle.json","state":"https://pith.science/pith/RFFGCJNLYXXUGSL3PBEXLELLAL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RFFGCJNLYXXUGSL3PBEXLELLAL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RFFGCJNLYXXUGSL3PBEXLELLAL","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":"a7e3d059bd8d05b6da4380fd77fc04789432749a22c9f804360cc02d4bb3564a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-19T15:55:36Z","title_canon_sha256":"4f8d865273231b5931a4e71217320ab7330cf69e8325f389ce5ce045c1b9d4b7"},"schema_version":"1.0","source":{"id":"1503.05812","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.05812","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"arxiv_version","alias_value":"1503.05812v3","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.05812","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"pith_short_12","alias_value":"RFFGCJNLYXXU","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RFFGCJNLYXXUGSL3","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RFFGCJNL","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:34de62cd586b98fddb5f34796e6982115c47f0933238c41cf79028b307a1e429","target":"graph","created_at":"2026-05-18T00:53:17Z","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 study the problem of approximately counting matchings in hypergraphs of bounded maximum degree and maximum size of hyperedges. With an activity parameter $\\lambda$, each matching $M$ is assigned a weight $\\lambda^{|M|}$. The counting problem is formulated as computing a partition function that gives the sum of the weights of all matchings in a hypergraph. This problem unifies two extensively studied statistical physics models in approximate counting: the hardcore model (graph independent sets) and the monomer-dimer model (graph matchings).\n  For this model, the critical activity $\\lambda_c=","authors_text":"Jinman Zhao, Renjie Song, Yitong Yin","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-19T15:55:36Z","title":"Counting hypergraph matchings up to uniqueness threshold"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.05812","kind":"arxiv","version":3},"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:7307e1c7762a38c2ca9e8c76e7f23adaf368a5ed20008fcde5647438975a524d","target":"record","created_at":"2026-05-18T00:53:17Z","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":"a7e3d059bd8d05b6da4380fd77fc04789432749a22c9f804360cc02d4bb3564a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-19T15:55:36Z","title_canon_sha256":"4f8d865273231b5931a4e71217320ab7330cf69e8325f389ce5ce045c1b9d4b7"},"schema_version":"1.0","source":{"id":"1503.05812","kind":"arxiv","version":3}},"canonical_sha256":"894a6125abc5ef43497b784975916b02e6771cb32a5122187bfe96a11addcd13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"894a6125abc5ef43497b784975916b02e6771cb32a5122187bfe96a11addcd13","first_computed_at":"2026-05-18T00:53:17.834222Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:17.834222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WpLwc3Qw3OZAWR6vZOJmh3hWG9LVj54ca2UMjj6wdvD5cCooReYLclqEqw92SiR2XnS6MvnurhZxq7nePK2mBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:17.834755Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.05812","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7307e1c7762a38c2ca9e8c76e7f23adaf368a5ed20008fcde5647438975a524d","sha256:34de62cd586b98fddb5f34796e6982115c47f0933238c41cf79028b307a1e429"],"state_sha256":"faf6ee01738cf00567a2a0bb4d26835931c16ab8b3f8ede605822e2366a7f0cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UuoG+d00TsbzBYtO9us37CG8rgWXHn6ZiLp/WrTUC/1ozBaaMSg34nwEgphv1yMfXP8KV83SBG9ZOGFUm1t5Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:07:05.563196Z","bundle_sha256":"22ae80892e66e25e73193726ad9bcae213a26cabc940cd03293cd505f203eb93"}}