{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2000:VFYWQVMJU5AAAUALMZKCVMGB7J","short_pith_number":"pith:VFYWQVMJ","canonical_record":{"source":{"id":"math/0012258","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2000-12-28T18:57:30Z","cross_cats_sorted":[],"title_canon_sha256":"cefa2a338638d243f075773f8850f0c70a43e6ceacd3466d63d77557a3cb1393","abstract_canon_sha256":"40e4c7ed1c7c287ed2d3377a4f43e39c83a9d0559f50be1150187b12056f1c69"},"schema_version":"1.0"},"canonical_sha256":"a971685589a74000500b66542ab0c1fa5226b9aea1cc0493e1eb73543c03edac","source":{"kind":"arxiv","id":"math/0012258","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0012258","created_at":"2026-07-04T14:35:00Z"},{"alias_kind":"arxiv_version","alias_value":"math/0012258v1","created_at":"2026-07-04T14:35:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0012258","created_at":"2026-07-04T14:35:00Z"},{"alias_kind":"pith_short_12","alias_value":"VFYWQVMJU5AA","created_at":"2026-07-04T14:35:00Z"},{"alias_kind":"pith_short_16","alias_value":"VFYWQVMJU5AAAUAL","created_at":"2026-07-04T14:35:00Z"},{"alias_kind":"pith_short_8","alias_value":"VFYWQVMJ","created_at":"2026-07-04T14:35:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2000:VFYWQVMJU5AAAUALMZKCVMGB7J","target":"record","payload":{"canonical_record":{"source":{"id":"math/0012258","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2000-12-28T18:57:30Z","cross_cats_sorted":[],"title_canon_sha256":"cefa2a338638d243f075773f8850f0c70a43e6ceacd3466d63d77557a3cb1393","abstract_canon_sha256":"40e4c7ed1c7c287ed2d3377a4f43e39c83a9d0559f50be1150187b12056f1c69"},"schema_version":"1.0"},"canonical_sha256":"a971685589a74000500b66542ab0c1fa5226b9aea1cc0493e1eb73543c03edac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:35:00.150256Z","signature_b64":"gPMZh9y8gDzJPTfb4TdvSlsobGg+C63v8XEnbkiDbwO3p/ePCvd2OJlAmoy4PBmWNq4iMCr75C/FxT5t0vmZAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a971685589a74000500b66542ab0c1fa5226b9aea1cc0493e1eb73543c03edac","last_reissued_at":"2026-07-04T14:35:00.149922Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:35:00.149922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0012258","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-04T14:35:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pcTn4GfGFZUaymXeFxLuI7X7MWLYwC/BZde1l9GzR1hqzlzdfMJJHxHMpnpbascews6njCLAvA1PA9FsLXX0CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T00:21:47.622671Z"},"content_sha256":"5a829f3ef241f2a281e275ad199579877f4ebc55584c4ae87110b7a53254a4c5","schema_version":"1.0","event_id":"sha256:5a829f3ef241f2a281e275ad199579877f4ebc55584c4ae87110b7a53254a4c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2000:VFYWQVMJU5AAAUALMZKCVMGB7J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum multiplicities of subgraphs and Hamiltonian systems","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"John Sheehan","submitted_at":"2000-12-28T18:57:30Z","abstract_excerpt":"Let G be a finite simple graph with automorphism group A(G). Then a spanning subgraph U of G is a fixing subgraph of G if G contains exactly $| A(G)|/ | A(G) \\cap A(U)| $ subgraphs isomorphic to U: the graph G must always contain at least this number. If in addition $A(U) \\subseteq A(G)$ then U is a strong fixing subgraph. Fixing subgraphs are important in many areas of graph theory. We consider them in the context of Hamiltonian graphs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0012258","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/math/0012258/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-04T14:35:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dE2Jm9m4wkb1EsgVKHjlO1S4uwGlTfmULT9ihX1//rfxzoO/zZNezqVQ5qtc3juJkcaMKOP7ZHgywu8oWi1eDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T00:21:47.623002Z"},"content_sha256":"94f693091656c225c0d9f481c8cee79532081b71e13e6f37adf1617b9479f886","schema_version":"1.0","event_id":"sha256:94f693091656c225c0d9f481c8cee79532081b71e13e6f37adf1617b9479f886"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VFYWQVMJU5AAAUALMZKCVMGB7J/bundle.json","state_url":"https://pith.science/pith/VFYWQVMJU5AAAUALMZKCVMGB7J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VFYWQVMJU5AAAUALMZKCVMGB7J/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-15T00:21:47Z","links":{"resolver":"https://pith.science/pith/VFYWQVMJU5AAAUALMZKCVMGB7J","bundle":"https://pith.science/pith/VFYWQVMJU5AAAUALMZKCVMGB7J/bundle.json","state":"https://pith.science/pith/VFYWQVMJU5AAAUALMZKCVMGB7J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VFYWQVMJU5AAAUALMZKCVMGB7J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2000:VFYWQVMJU5AAAUALMZKCVMGB7J","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":"40e4c7ed1c7c287ed2d3377a4f43e39c83a9d0559f50be1150187b12056f1c69","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2000-12-28T18:57:30Z","title_canon_sha256":"cefa2a338638d243f075773f8850f0c70a43e6ceacd3466d63d77557a3cb1393"},"schema_version":"1.0","source":{"id":"math/0012258","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0012258","created_at":"2026-07-04T14:35:00Z"},{"alias_kind":"arxiv_version","alias_value":"math/0012258v1","created_at":"2026-07-04T14:35:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0012258","created_at":"2026-07-04T14:35:00Z"},{"alias_kind":"pith_short_12","alias_value":"VFYWQVMJU5AA","created_at":"2026-07-04T14:35:00Z"},{"alias_kind":"pith_short_16","alias_value":"VFYWQVMJU5AAAUAL","created_at":"2026-07-04T14:35:00Z"},{"alias_kind":"pith_short_8","alias_value":"VFYWQVMJ","created_at":"2026-07-04T14:35:00Z"}],"graph_snapshots":[{"event_id":"sha256:94f693091656c225c0d9f481c8cee79532081b71e13e6f37adf1617b9479f886","target":"graph","created_at":"2026-07-04T14:35:00Z","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/math/0012258/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let G be a finite simple graph with automorphism group A(G). Then a spanning subgraph U of G is a fixing subgraph of G if G contains exactly $| A(G)|/ | A(G) \\cap A(U)| $ subgraphs isomorphic to U: the graph G must always contain at least this number. If in addition $A(U) \\subseteq A(G)$ then U is a strong fixing subgraph. Fixing subgraphs are important in many areas of graph theory. We consider them in the context of Hamiltonian graphs","authors_text":"John Sheehan","cross_cats":[],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2000-12-28T18:57:30Z","title":"Minimum multiplicities of subgraphs and Hamiltonian systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0012258","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:5a829f3ef241f2a281e275ad199579877f4ebc55584c4ae87110b7a53254a4c5","target":"record","created_at":"2026-07-04T14:35:00Z","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":"40e4c7ed1c7c287ed2d3377a4f43e39c83a9d0559f50be1150187b12056f1c69","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2000-12-28T18:57:30Z","title_canon_sha256":"cefa2a338638d243f075773f8850f0c70a43e6ceacd3466d63d77557a3cb1393"},"schema_version":"1.0","source":{"id":"math/0012258","kind":"arxiv","version":1}},"canonical_sha256":"a971685589a74000500b66542ab0c1fa5226b9aea1cc0493e1eb73543c03edac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a971685589a74000500b66542ab0c1fa5226b9aea1cc0493e1eb73543c03edac","first_computed_at":"2026-07-04T14:35:00.149922Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:35:00.149922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gPMZh9y8gDzJPTfb4TdvSlsobGg+C63v8XEnbkiDbwO3p/ePCvd2OJlAmoy4PBmWNq4iMCr75C/FxT5t0vmZAA==","signature_status":"signed_v1","signed_at":"2026-07-04T14:35:00.150256Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0012258","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a829f3ef241f2a281e275ad199579877f4ebc55584c4ae87110b7a53254a4c5","sha256:94f693091656c225c0d9f481c8cee79532081b71e13e6f37adf1617b9479f886"],"state_sha256":"ff5d74187863d76fed958692c4ad6cd2d6ec678e6e63ec464ecd6fbd345bfd2a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wdD1nibMdXxp10a0DQQPltLgLfKxZ6KEJRTVX0zmfLQGx5uzAQcfvClABluaUjJQnvzKAcLVW1gAM4odFDjQDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T00:21:47.625454Z","bundle_sha256":"8c67d93591c84b0ea56c05a18d78f2b4abdaa4594c2488f91d18549cb352259d"}}