{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MENFMDQ54GCN6F3PITBE2PFZV3","short_pith_number":"pith:MENFMDQ5","schema_version":"1.0","canonical_sha256":"611a560e1de184df176f44c24d3cb9aed7f3b4900f64470f892bf79a1d143f2e","source":{"kind":"arxiv","id":"1908.01001","version":1},"attestation_state":"computed","paper":{"title":"Distinguishing Number of Non-Zero Component Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"H. Benish, I. Javaid, M. Murtaza","submitted_at":"2019-08-01T16:33:25Z","abstract_excerpt":"A non-zero component graph $G(\\mathbb{V})$ associated to a finite vector space $\\mathbb{V}$ is a graph whose vertices are non-zero vectors of $\\mathbb{V}$ and two vertices are adjacent, if their corresponding vectors have at least one non-zero component common in their linear combination of basis vectors. In this paper, we extend the study of properties of automorphisms of non-zero component graphs. We prove that every permutation of basis vectors can be extended to an automorphism of $G(\\mathbb{V})$. We prove that the symmetric group of basis vectors of $\\mathbb{V}$ is isomorphic to the autom"},"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":"1908.01001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-01T16:33:25Z","cross_cats_sorted":[],"title_canon_sha256":"e800b31eb6c2f89f32d1b9bdd21a8379c0e67a75775016b46eb8dbf91c366d3c","abstract_canon_sha256":"c9a2bba0b12f320231d9d48591a9bea5450db3ebd5ae925ba6144dd44da02220"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:51:25.463908Z","signature_b64":"JOsmPUN+2SVTvzOZcVM8A0ntcm6KW8oVm4zbtFVc0fG/T2HqUJxp9a/iHkwlyQda6cTFOjqVtHycX6Vz4oWJDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"611a560e1de184df176f44c24d3cb9aed7f3b4900f64470f892bf79a1d143f2e","last_reissued_at":"2026-07-04T23:51:25.463342Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:51:25.463342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distinguishing Number of Non-Zero Component Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"H. Benish, I. Javaid, M. Murtaza","submitted_at":"2019-08-01T16:33:25Z","abstract_excerpt":"A non-zero component graph $G(\\mathbb{V})$ associated to a finite vector space $\\mathbb{V}$ is a graph whose vertices are non-zero vectors of $\\mathbb{V}$ and two vertices are adjacent, if their corresponding vectors have at least one non-zero component common in their linear combination of basis vectors. In this paper, we extend the study of properties of automorphisms of non-zero component graphs. We prove that every permutation of basis vectors can be extended to an automorphism of $G(\\mathbb{V})$. We prove that the symmetric group of basis vectors of $\\mathbb{V}$ is isomorphic to the autom"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01001","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/1908.01001/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1908.01001","created_at":"2026-07-04T23:51:25.463412+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.01001v1","created_at":"2026-07-04T23:51:25.463412+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01001","created_at":"2026-07-04T23:51:25.463412+00:00"},{"alias_kind":"pith_short_12","alias_value":"MENFMDQ54GCN","created_at":"2026-07-04T23:51:25.463412+00:00"},{"alias_kind":"pith_short_16","alias_value":"MENFMDQ54GCN6F3P","created_at":"2026-07-04T23:51:25.463412+00:00"},{"alias_kind":"pith_short_8","alias_value":"MENFMDQ5","created_at":"2026-07-04T23:51:25.463412+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/MENFMDQ54GCN6F3PITBE2PFZV3","json":"https://pith.science/pith/MENFMDQ54GCN6F3PITBE2PFZV3.json","graph_json":"https://pith.science/api/pith-number/MENFMDQ54GCN6F3PITBE2PFZV3/graph.json","events_json":"https://pith.science/api/pith-number/MENFMDQ54GCN6F3PITBE2PFZV3/events.json","paper":"https://pith.science/paper/MENFMDQ5"},"agent_actions":{"view_html":"https://pith.science/pith/MENFMDQ54GCN6F3PITBE2PFZV3","download_json":"https://pith.science/pith/MENFMDQ54GCN6F3PITBE2PFZV3.json","view_paper":"https://pith.science/paper/MENFMDQ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.01001&json=true","fetch_graph":"https://pith.science/api/pith-number/MENFMDQ54GCN6F3PITBE2PFZV3/graph.json","fetch_events":"https://pith.science/api/pith-number/MENFMDQ54GCN6F3PITBE2PFZV3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MENFMDQ54GCN6F3PITBE2PFZV3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MENFMDQ54GCN6F3PITBE2PFZV3/action/storage_attestation","attest_author":"https://pith.science/pith/MENFMDQ54GCN6F3PITBE2PFZV3/action/author_attestation","sign_citation":"https://pith.science/pith/MENFMDQ54GCN6F3PITBE2PFZV3/action/citation_signature","submit_replication":"https://pith.science/pith/MENFMDQ54GCN6F3PITBE2PFZV3/action/replication_record"}},"created_at":"2026-07-04T23:51:25.463412+00:00","updated_at":"2026-07-04T23:51:25.463412+00:00"}