{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GVFQR7M6QIBJDM4BY45OXPZGZU","short_pith_number":"pith:GVFQR7M6","canonical_record":{"source":{"id":"1507.00517","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-02T10:53:46Z","cross_cats_sorted":[],"title_canon_sha256":"e9988f330cbc3923e1840a380d4af5968f8e5f730a8be9e021d68941e983ba0c","abstract_canon_sha256":"b6eca64635fb01d5d6e1bf84c64cea6b134d0b5cfe4c678990c1b51aab3d420c"},"schema_version":"1.0"},"canonical_sha256":"354b08fd9e820291b381c73aebbf26cd044a33ee02d5b9ec51ec80aa5e180393","source":{"kind":"arxiv","id":"1507.00517","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.00517","created_at":"2026-05-18T01:37:24Z"},{"alias_kind":"arxiv_version","alias_value":"1507.00517v1","created_at":"2026-05-18T01:37:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00517","created_at":"2026-05-18T01:37:24Z"},{"alias_kind":"pith_short_12","alias_value":"GVFQR7M6QIBJ","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GVFQR7M6QIBJDM4B","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GVFQR7M6","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GVFQR7M6QIBJDM4BY45OXPZGZU","target":"record","payload":{"canonical_record":{"source":{"id":"1507.00517","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-02T10:53:46Z","cross_cats_sorted":[],"title_canon_sha256":"e9988f330cbc3923e1840a380d4af5968f8e5f730a8be9e021d68941e983ba0c","abstract_canon_sha256":"b6eca64635fb01d5d6e1bf84c64cea6b134d0b5cfe4c678990c1b51aab3d420c"},"schema_version":"1.0"},"canonical_sha256":"354b08fd9e820291b381c73aebbf26cd044a33ee02d5b9ec51ec80aa5e180393","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:24.450147Z","signature_b64":"HbbxDwr5VWIqHxUKTorsocx2sIKluQzCS3tNj3TFWyPJD106XWObwQ+NinBp8UmvKJur9qF6E/DodhRyFDBbCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"354b08fd9e820291b381c73aebbf26cd044a33ee02d5b9ec51ec80aa5e180393","last_reissued_at":"2026-05-18T01:37:24.449480Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:24.449480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.00517","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-05-18T01:37:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iGAEstBXfs+ijrgdgpTDd73Cpks4rqGC9RKZQylHeMbReWOrw+3FVuYla29g3VXOgNcbj+62hkAfOPyeDlxOAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T02:47:43.690875Z"},"content_sha256":"d27b900717fef6d96249992fd8f8be13d59e283ef26a9c118ba5bec2633a3dd3","schema_version":"1.0","event_id":"sha256:d27b900717fef6d96249992fd8f8be13d59e283ef26a9c118ba5bec2633a3dd3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GVFQR7M6QIBJDM4BY45OXPZGZU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On The Fixed Number of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"F. Iftikhar, I. Javaid, M. Asif, M. Murtaza","submitted_at":"2015-07-02T10:53:46Z","abstract_excerpt":"An automorphism on a graph $G$ is a bijective mapping on the vertex set $V(G)$, which preserves the relation of adjacency between any two vertices of $G$. An automorphism $g$ fixes a vertex $v$ if $g$ maps $v$ onto itself. The stabilizer of a set $S$ of vertices is the set of all automorphisms that fix vertices of $S$. A set $F$ is called fixing set of $G$, if its stabilizer is trivial. The fixing number of a graph is the cardinality of a smallest fixing set. The fixed number of a graph $G$ is the minimum $k$, such that every $k$-set of vertices of $G$ is a fixing set of $G$. A graph $G$ is ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00517","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":""},"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-18T01:37:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hVyQs3IPoLkso+V4lBhPl7eZOkfKXl3lEDKfLJYfGR7TMMKTjtnD/SSEN0Reo2dkNQffKsH2czcS4MhDm+5fBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T02:47:43.691229Z"},"content_sha256":"85dba27a24fc653b8d12813e976173c7339ebfed2f29381174ab3abbf2fccaea","schema_version":"1.0","event_id":"sha256:85dba27a24fc653b8d12813e976173c7339ebfed2f29381174ab3abbf2fccaea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GVFQR7M6QIBJDM4BY45OXPZGZU/bundle.json","state_url":"https://pith.science/pith/GVFQR7M6QIBJDM4BY45OXPZGZU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GVFQR7M6QIBJDM4BY45OXPZGZU/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-07-02T02:47:43Z","links":{"resolver":"https://pith.science/pith/GVFQR7M6QIBJDM4BY45OXPZGZU","bundle":"https://pith.science/pith/GVFQR7M6QIBJDM4BY45OXPZGZU/bundle.json","state":"https://pith.science/pith/GVFQR7M6QIBJDM4BY45OXPZGZU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GVFQR7M6QIBJDM4BY45OXPZGZU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GVFQR7M6QIBJDM4BY45OXPZGZU","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":"b6eca64635fb01d5d6e1bf84c64cea6b134d0b5cfe4c678990c1b51aab3d420c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-02T10:53:46Z","title_canon_sha256":"e9988f330cbc3923e1840a380d4af5968f8e5f730a8be9e021d68941e983ba0c"},"schema_version":"1.0","source":{"id":"1507.00517","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.00517","created_at":"2026-05-18T01:37:24Z"},{"alias_kind":"arxiv_version","alias_value":"1507.00517v1","created_at":"2026-05-18T01:37:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00517","created_at":"2026-05-18T01:37:24Z"},{"alias_kind":"pith_short_12","alias_value":"GVFQR7M6QIBJ","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GVFQR7M6QIBJDM4B","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GVFQR7M6","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:85dba27a24fc653b8d12813e976173c7339ebfed2f29381174ab3abbf2fccaea","target":"graph","created_at":"2026-05-18T01:37:24Z","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":"An automorphism on a graph $G$ is a bijective mapping on the vertex set $V(G)$, which preserves the relation of adjacency between any two vertices of $G$. An automorphism $g$ fixes a vertex $v$ if $g$ maps $v$ onto itself. The stabilizer of a set $S$ of vertices is the set of all automorphisms that fix vertices of $S$. A set $F$ is called fixing set of $G$, if its stabilizer is trivial. The fixing number of a graph is the cardinality of a smallest fixing set. The fixed number of a graph $G$ is the minimum $k$, such that every $k$-set of vertices of $G$ is a fixing set of $G$. A graph $G$ is ca","authors_text":"F. Iftikhar, I. Javaid, M. Asif, M. Murtaza","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-02T10:53:46Z","title":"On The Fixed Number of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00517","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:d27b900717fef6d96249992fd8f8be13d59e283ef26a9c118ba5bec2633a3dd3","target":"record","created_at":"2026-05-18T01:37:24Z","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":"b6eca64635fb01d5d6e1bf84c64cea6b134d0b5cfe4c678990c1b51aab3d420c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-02T10:53:46Z","title_canon_sha256":"e9988f330cbc3923e1840a380d4af5968f8e5f730a8be9e021d68941e983ba0c"},"schema_version":"1.0","source":{"id":"1507.00517","kind":"arxiv","version":1}},"canonical_sha256":"354b08fd9e820291b381c73aebbf26cd044a33ee02d5b9ec51ec80aa5e180393","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"354b08fd9e820291b381c73aebbf26cd044a33ee02d5b9ec51ec80aa5e180393","first_computed_at":"2026-05-18T01:37:24.449480Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:24.449480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HbbxDwr5VWIqHxUKTorsocx2sIKluQzCS3tNj3TFWyPJD106XWObwQ+NinBp8UmvKJur9qF6E/DodhRyFDBbCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:24.450147Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.00517","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d27b900717fef6d96249992fd8f8be13d59e283ef26a9c118ba5bec2633a3dd3","sha256:85dba27a24fc653b8d12813e976173c7339ebfed2f29381174ab3abbf2fccaea"],"state_sha256":"2fde79347bc7fe3fb0d9f5547ef3c759e4b85e23ee1342062413abb6d84c0673"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rEcr2bb2GUhBep2gpLfNFPv9xrM6PTVQvcF48PZTvnh7BTUCfuSiQs3iilsKRwjMK3l8FMa8KdCPjOjAqoW0Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T02:47:43.693445Z","bundle_sha256":"27619cbc7a46009c74003a01cb23167d03645bb62af8f5b9412d5af4f52defcd"}}