{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GVFQR7M6QIBJDM4BY45OXPZGZU","short_pith_number":"pith:GVFQR7M6","schema_version":"1.0","canonical_sha256":"354b08fd9e820291b381c73aebbf26cd044a33ee02d5b9ec51ec80aa5e180393","source":{"kind":"arxiv","id":"1507.00517","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.00517","created_at":"2026-05-18T01:37:24.449582+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.00517v1","created_at":"2026-05-18T01:37:24.449582+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00517","created_at":"2026-05-18T01:37:24.449582+00:00"},{"alias_kind":"pith_short_12","alias_value":"GVFQR7M6QIBJ","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GVFQR7M6QIBJDM4B","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GVFQR7M6","created_at":"2026-05-18T12:29:22.688609+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GVFQR7M6QIBJDM4BY45OXPZGZU","json":"https://pith.science/pith/GVFQR7M6QIBJDM4BY45OXPZGZU.json","graph_json":"https://pith.science/api/pith-number/GVFQR7M6QIBJDM4BY45OXPZGZU/graph.json","events_json":"https://pith.science/api/pith-number/GVFQR7M6QIBJDM4BY45OXPZGZU/events.json","paper":"https://pith.science/paper/GVFQR7M6"},"agent_actions":{"view_html":"https://pith.science/pith/GVFQR7M6QIBJDM4BY45OXPZGZU","download_json":"https://pith.science/pith/GVFQR7M6QIBJDM4BY45OXPZGZU.json","view_paper":"https://pith.science/paper/GVFQR7M6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.00517&json=true","fetch_graph":"https://pith.science/api/pith-number/GVFQR7M6QIBJDM4BY45OXPZGZU/graph.json","fetch_events":"https://pith.science/api/pith-number/GVFQR7M6QIBJDM4BY45OXPZGZU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GVFQR7M6QIBJDM4BY45OXPZGZU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GVFQR7M6QIBJDM4BY45OXPZGZU/action/storage_attestation","attest_author":"https://pith.science/pith/GVFQR7M6QIBJDM4BY45OXPZGZU/action/author_attestation","sign_citation":"https://pith.science/pith/GVFQR7M6QIBJDM4BY45OXPZGZU/action/citation_signature","submit_replication":"https://pith.science/pith/GVFQR7M6QIBJDM4BY45OXPZGZU/action/replication_record"}},"created_at":"2026-05-18T01:37:24.449582+00:00","updated_at":"2026-05-18T01:37:24.449582+00:00"}