{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:3GGKOA3WYKMHCX2YOOPJRTA4TF","short_pith_number":"pith:3GGKOA3W","canonical_record":{"source":{"id":"2410.22951","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-10-30T12:07:43Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"cb111890f6f0594940a528c0dc7c816fdcc830a512fa5615ea664694363bff28","abstract_canon_sha256":"cd9dc41c62e42901ea73b732b2c3211e6a5c5030aefe10d010f7b8ab211e8cca"},"schema_version":"1.0"},"canonical_sha256":"d98ca70376c298715f58739e98cc1c99415847246450e33d0e98430b0d28b761","source":{"kind":"arxiv","id":"2410.22951","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.22951","created_at":"2026-07-05T09:28:38Z"},{"alias_kind":"arxiv_version","alias_value":"2410.22951v1","created_at":"2026-07-05T09:28:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.22951","created_at":"2026-07-05T09:28:38Z"},{"alias_kind":"pith_short_12","alias_value":"3GGKOA3WYKMH","created_at":"2026-07-05T09:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"3GGKOA3WYKMHCX2Y","created_at":"2026-07-05T09:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"3GGKOA3W","created_at":"2026-07-05T09:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:3GGKOA3WYKMHCX2YOOPJRTA4TF","target":"record","payload":{"canonical_record":{"source":{"id":"2410.22951","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-10-30T12:07:43Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"cb111890f6f0594940a528c0dc7c816fdcc830a512fa5615ea664694363bff28","abstract_canon_sha256":"cd9dc41c62e42901ea73b732b2c3211e6a5c5030aefe10d010f7b8ab211e8cca"},"schema_version":"1.0"},"canonical_sha256":"d98ca70376c298715f58739e98cc1c99415847246450e33d0e98430b0d28b761","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:28:38.842963Z","signature_b64":"B52XCRRWLE5E50M0t5mv0EEGpYrI4Wm9ImhB6kwczT195sTfH/jxkOKl+mxJ452Lk0WabOPmsrP43HerZ+lADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d98ca70376c298715f58739e98cc1c99415847246450e33d0e98430b0d28b761","last_reissued_at":"2026-07-05T09:28:38.842563Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:28:38.842563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.22951","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-05T09:28:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uflWR56FHPUll0TUb2+Xcm+x1hZxvicalGXh2sdF5Ry/hI+PCn19n2osDYY7wc7aYDYNyeYfvcQPzYNuDg5SAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T18:38:26.366755Z"},"content_sha256":"63204d4c173e5e52f3b26ea52c24b64b745962fd973725864a276db996dc4b70","schema_version":"1.0","event_id":"sha256:63204d4c173e5e52f3b26ea52c24b64b745962fd973725864a276db996dc4b70"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:3GGKOA3WYKMHCX2YOOPJRTA4TF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sampling and counting triangle-free graphs near the critical density","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Aditya Potukuchi, Matthew Jenssen, Michael Simkin, Will Perkins","submitted_at":"2024-10-30T12:07:43Z","abstract_excerpt":"We study the following combinatorial counting and sampling problems: can we efficiently sample from the Erd\\H{o}s-R\\'{e}nyi random graph $G(n,p)$ conditioned on triangle-freeness? Can we efficiently approximate the probability that $G(n,p)$ is triangle-free? These are prototypical instances of forbidden substructure problems ubiquitous in combinatorics. The algorithmic questions are instances of approximate counting and sampling for a hypergraph hard-core model.\n  Estimating the probability that $G(n,p)$ has no triangles is a fundamental question in probabilistic combinatorics and one that has"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.22951","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/2410.22951/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-05T09:28:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l2djsQ+xYG2h40++KA6dAL0IUd9DpxD5UgIfFVlw2lUnS4NePgn7xUhfDRqQfpFB88nAOVYDdpgGRWo1iDMgBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T18:38:26.367301Z"},"content_sha256":"6dce403cb1dbfa3b3bc4e41ce2d3ac4a6f697d7c15efa2e83450bd3cbddce14c","schema_version":"1.0","event_id":"sha256:6dce403cb1dbfa3b3bc4e41ce2d3ac4a6f697d7c15efa2e83450bd3cbddce14c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3GGKOA3WYKMHCX2YOOPJRTA4TF/bundle.json","state_url":"https://pith.science/pith/3GGKOA3WYKMHCX2YOOPJRTA4TF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3GGKOA3WYKMHCX2YOOPJRTA4TF/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-06T18:38:26Z","links":{"resolver":"https://pith.science/pith/3GGKOA3WYKMHCX2YOOPJRTA4TF","bundle":"https://pith.science/pith/3GGKOA3WYKMHCX2YOOPJRTA4TF/bundle.json","state":"https://pith.science/pith/3GGKOA3WYKMHCX2YOOPJRTA4TF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3GGKOA3WYKMHCX2YOOPJRTA4TF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:3GGKOA3WYKMHCX2YOOPJRTA4TF","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":"cd9dc41c62e42901ea73b732b2c3211e6a5c5030aefe10d010f7b8ab211e8cca","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-10-30T12:07:43Z","title_canon_sha256":"cb111890f6f0594940a528c0dc7c816fdcc830a512fa5615ea664694363bff28"},"schema_version":"1.0","source":{"id":"2410.22951","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.22951","created_at":"2026-07-05T09:28:38Z"},{"alias_kind":"arxiv_version","alias_value":"2410.22951v1","created_at":"2026-07-05T09:28:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.22951","created_at":"2026-07-05T09:28:38Z"},{"alias_kind":"pith_short_12","alias_value":"3GGKOA3WYKMH","created_at":"2026-07-05T09:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"3GGKOA3WYKMHCX2Y","created_at":"2026-07-05T09:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"3GGKOA3W","created_at":"2026-07-05T09:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:6dce403cb1dbfa3b3bc4e41ce2d3ac4a6f697d7c15efa2e83450bd3cbddce14c","target":"graph","created_at":"2026-07-05T09:28:38Z","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/2410.22951/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the following combinatorial counting and sampling problems: can we efficiently sample from the Erd\\H{o}s-R\\'{e}nyi random graph $G(n,p)$ conditioned on triangle-freeness? Can we efficiently approximate the probability that $G(n,p)$ is triangle-free? These are prototypical instances of forbidden substructure problems ubiquitous in combinatorics. The algorithmic questions are instances of approximate counting and sampling for a hypergraph hard-core model.\n  Estimating the probability that $G(n,p)$ has no triangles is a fundamental question in probabilistic combinatorics and one that has","authors_text":"Aditya Potukuchi, Matthew Jenssen, Michael Simkin, Will Perkins","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-10-30T12:07:43Z","title":"Sampling and counting triangle-free graphs near the critical density"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.22951","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:63204d4c173e5e52f3b26ea52c24b64b745962fd973725864a276db996dc4b70","target":"record","created_at":"2026-07-05T09:28:38Z","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":"cd9dc41c62e42901ea73b732b2c3211e6a5c5030aefe10d010f7b8ab211e8cca","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-10-30T12:07:43Z","title_canon_sha256":"cb111890f6f0594940a528c0dc7c816fdcc830a512fa5615ea664694363bff28"},"schema_version":"1.0","source":{"id":"2410.22951","kind":"arxiv","version":1}},"canonical_sha256":"d98ca70376c298715f58739e98cc1c99415847246450e33d0e98430b0d28b761","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d98ca70376c298715f58739e98cc1c99415847246450e33d0e98430b0d28b761","first_computed_at":"2026-07-05T09:28:38.842563Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:28:38.842563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B52XCRRWLE5E50M0t5mv0EEGpYrI4Wm9ImhB6kwczT195sTfH/jxkOKl+mxJ452Lk0WabOPmsrP43HerZ+lADQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:28:38.842963Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.22951","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63204d4c173e5e52f3b26ea52c24b64b745962fd973725864a276db996dc4b70","sha256:6dce403cb1dbfa3b3bc4e41ce2d3ac4a6f697d7c15efa2e83450bd3cbddce14c"],"state_sha256":"fbaa40dc7886790e21067c64eb769c789e61559d6e998b16ae56e1fb75142574"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QwiRuvp5gMdze2GiE0TYK792LwgyUfip3l4NVc0X51hUwNesb0LdzXtcARh9fcUO68dkS2qP8/wb0dTylMh0BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T18:38:26.378013Z","bundle_sha256":"9acc3b5853fc2586d2045b23a7ee4af888b66fe7f5f41931c267ec6051021eaa"}}