{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:AU5AVRRKEJ62QZKURCBWLRCOVB","short_pith_number":"pith:AU5AVRRK","canonical_record":{"source":{"id":"1303.0026","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-28T21:40:24Z","cross_cats_sorted":[],"title_canon_sha256":"2896229cd25fd0304655610f3f126bf447eaa08541e23f0967e659cfae7e2e5a","abstract_canon_sha256":"e3b12417789b192d591319e196739773a3bd24831d926b583b6141828e455cea"},"schema_version":"1.0"},"canonical_sha256":"053a0ac62a227da86554888365c44ea85e9d3049f995403915c80a83c1fc4303","source":{"kind":"arxiv","id":"1303.0026","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0026","created_at":"2026-05-18T03:16:51Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0026v3","created_at":"2026-05-18T03:16:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0026","created_at":"2026-05-18T03:16:51Z"},{"alias_kind":"pith_short_12","alias_value":"AU5AVRRKEJ62","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AU5AVRRKEJ62QZKU","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AU5AVRRK","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:AU5AVRRKEJ62QZKURCBWLRCOVB","target":"record","payload":{"canonical_record":{"source":{"id":"1303.0026","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-28T21:40:24Z","cross_cats_sorted":[],"title_canon_sha256":"2896229cd25fd0304655610f3f126bf447eaa08541e23f0967e659cfae7e2e5a","abstract_canon_sha256":"e3b12417789b192d591319e196739773a3bd24831d926b583b6141828e455cea"},"schema_version":"1.0"},"canonical_sha256":"053a0ac62a227da86554888365c44ea85e9d3049f995403915c80a83c1fc4303","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:51.145835Z","signature_b64":"qbKij+NptVuxSckE2RiqZd9CMJDh+UFYpjA08HqOGPCPEnfNUeNjwxN3NzNupeZSxYKRyyxXtkcVmnfCEFucAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"053a0ac62a227da86554888365c44ea85e9d3049f995403915c80a83c1fc4303","last_reissued_at":"2026-05-18T03:16:51.145287Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:51.145287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.0026","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-18T03:16:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fSmjxZpYchY08pMWdIU35j6yGHoY43NZE5jTDGtatyxwxS1mzOYljF0EP1TvSZlRli7ROd1AbJGvX3zlwIPoCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T23:48:38.515144Z"},"content_sha256":"03beb06663245ebaa99c6834af53db0098d746bdbebfe5655430f9b103e37fea","schema_version":"1.0","event_id":"sha256:03beb06663245ebaa99c6834af53db0098d746bdbebfe5655430f9b103e37fea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:AU5AVRRKEJ62QZKURCBWLRCOVB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"When Hamilton circuits generate the cycle space of a random graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Peter C. Heinig","submitted_at":"2013-02-28T21:40:24Z","abstract_excerpt":"If eps > 0 and p >= n^{-1/2 + eps}, in a binomial random graph G(n,p) a.a.s. the set of cycles which can be constructed as a symmetric difference of Hamilton circuits is as large as parity by itself permits (all cycles if n is odd, all even cycles if n is even). Moreover, every p which ensures the above property a.a.s. must necessarily be such that for any constant c>0, eventually p >= (log n + 2 log log n + c)/n. So, whatever the smallest sufficient p for an a.a.s. Hamilton-generated cycle space might be, it does not coincide with the threshold for hamiltonicity of G(n,p)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0026","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-18T03:16:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AcPnedVJX2wx7yrfm7MEKbCN7PEOEyVYUF8k6LYHyr0KluDzx4UiC05QbgZD4XD5vr31GiJL4EgFrNplevcoDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T23:48:38.515990Z"},"content_sha256":"5aaef878c7a6e0a997117ba735ee981197a3e6356b74e7e37012c972d788c102","schema_version":"1.0","event_id":"sha256:5aaef878c7a6e0a997117ba735ee981197a3e6356b74e7e37012c972d788c102"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AU5AVRRKEJ62QZKURCBWLRCOVB/bundle.json","state_url":"https://pith.science/pith/AU5AVRRKEJ62QZKURCBWLRCOVB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AU5AVRRKEJ62QZKURCBWLRCOVB/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-09T23:48:38Z","links":{"resolver":"https://pith.science/pith/AU5AVRRKEJ62QZKURCBWLRCOVB","bundle":"https://pith.science/pith/AU5AVRRKEJ62QZKURCBWLRCOVB/bundle.json","state":"https://pith.science/pith/AU5AVRRKEJ62QZKURCBWLRCOVB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AU5AVRRKEJ62QZKURCBWLRCOVB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:AU5AVRRKEJ62QZKURCBWLRCOVB","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":"e3b12417789b192d591319e196739773a3bd24831d926b583b6141828e455cea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-28T21:40:24Z","title_canon_sha256":"2896229cd25fd0304655610f3f126bf447eaa08541e23f0967e659cfae7e2e5a"},"schema_version":"1.0","source":{"id":"1303.0026","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0026","created_at":"2026-05-18T03:16:51Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0026v3","created_at":"2026-05-18T03:16:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0026","created_at":"2026-05-18T03:16:51Z"},{"alias_kind":"pith_short_12","alias_value":"AU5AVRRKEJ62","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AU5AVRRKEJ62QZKU","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AU5AVRRK","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:5aaef878c7a6e0a997117ba735ee981197a3e6356b74e7e37012c972d788c102","target":"graph","created_at":"2026-05-18T03:16:51Z","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":"If eps > 0 and p >= n^{-1/2 + eps}, in a binomial random graph G(n,p) a.a.s. the set of cycles which can be constructed as a symmetric difference of Hamilton circuits is as large as parity by itself permits (all cycles if n is odd, all even cycles if n is even). Moreover, every p which ensures the above property a.a.s. must necessarily be such that for any constant c>0, eventually p >= (log n + 2 log log n + c)/n. So, whatever the smallest sufficient p for an a.a.s. Hamilton-generated cycle space might be, it does not coincide with the threshold for hamiltonicity of G(n,p).","authors_text":"Peter C. Heinig","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-28T21:40:24Z","title":"When Hamilton circuits generate the cycle space of a random graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0026","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:03beb06663245ebaa99c6834af53db0098d746bdbebfe5655430f9b103e37fea","target":"record","created_at":"2026-05-18T03:16:51Z","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":"e3b12417789b192d591319e196739773a3bd24831d926b583b6141828e455cea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-28T21:40:24Z","title_canon_sha256":"2896229cd25fd0304655610f3f126bf447eaa08541e23f0967e659cfae7e2e5a"},"schema_version":"1.0","source":{"id":"1303.0026","kind":"arxiv","version":3}},"canonical_sha256":"053a0ac62a227da86554888365c44ea85e9d3049f995403915c80a83c1fc4303","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"053a0ac62a227da86554888365c44ea85e9d3049f995403915c80a83c1fc4303","first_computed_at":"2026-05-18T03:16:51.145287Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:16:51.145287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qbKij+NptVuxSckE2RiqZd9CMJDh+UFYpjA08HqOGPCPEnfNUeNjwxN3NzNupeZSxYKRyyxXtkcVmnfCEFucAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:16:51.145835Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.0026","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03beb06663245ebaa99c6834af53db0098d746bdbebfe5655430f9b103e37fea","sha256:5aaef878c7a6e0a997117ba735ee981197a3e6356b74e7e37012c972d788c102"],"state_sha256":"a57130a0bf27b0b0036e49a7ff1fc15e148814619237c743b68431b7599a9e10"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a9uOM7KDhuw6tCc/nUsi1rzMeNPmOBuRTJD+URQDDNr/yEnEx63+UFujyKrfkFK4IxVrjVamq5Ew5540XuJXBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T23:48:38.538018Z","bundle_sha256":"c6c4041245f890a61184c21d3a9631faa917c2067d8012d79b060d3a19e6a91e"}}