{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BPL7UKIKD2KVKJQDQKXBJA2SZ3","short_pith_number":"pith:BPL7UKIK","schema_version":"1.0","canonical_sha256":"0bd7fa290a1e9555260382ae148352ced8c57a63240dc586f93ef2862deb1f38","source":{"kind":"arxiv","id":"1507.02053","version":1},"attestation_state":"computed","paper":{"title":"On fixing sets of composition and corona product of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"I. Irshad, I. Javaid, M. S. Aasi, M. Salman","submitted_at":"2015-07-08T07:46:02Z","abstract_excerpt":"A fixing set $\\mathcal{F}$ of a graph $G$ is a set of those vertices of the graph $G$ which when assigned distinct labels removes all the automorphisms from the graph except the trivial one. The fixing number of a graph $G$, denoted by $fix(G)$, is the smallest cardinality of a fixing set of $G$. In this paper, we study the fixing number of composition product, $G_1[G_2]$ and corona product, $G_1 \\odot G_2$ of two graphs $G_1$ and $G_2$ with orders $m$ and $n$ respectively. We show that for a connected graph $G_1$ and an arbitrary graph $G_2$ having $l\\geq 1$ components $G_2^1$, $G_2^2$, ... $"},"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.02053","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-08T07:46:02Z","cross_cats_sorted":[],"title_canon_sha256":"8dbc0b88e7faac39b1f6324a09e5f8549255878427a08b4018d9743c9a28197c","abstract_canon_sha256":"bba0cb702e423543cefe7976ef3d64db8ae998c5ba4700d473e7fe5535082f14"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:08.723085Z","signature_b64":"L4RoRvuMtWHqENbfaHRbkyyh08b5ma8ia+t6GLs9dZR0Tw0w5IpxP0r3gPidFKxwQejE0u5S4mvOQw9IzsJhDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0bd7fa290a1e9555260382ae148352ced8c57a63240dc586f93ef2862deb1f38","last_reissued_at":"2026-05-18T01:37:08.722511Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:08.722511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On fixing sets of composition and corona product of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"I. Irshad, I. Javaid, M. S. Aasi, M. Salman","submitted_at":"2015-07-08T07:46:02Z","abstract_excerpt":"A fixing set $\\mathcal{F}$ of a graph $G$ is a set of those vertices of the graph $G$ which when assigned distinct labels removes all the automorphisms from the graph except the trivial one. The fixing number of a graph $G$, denoted by $fix(G)$, is the smallest cardinality of a fixing set of $G$. In this paper, we study the fixing number of composition product, $G_1[G_2]$ and corona product, $G_1 \\odot G_2$ of two graphs $G_1$ and $G_2$ with orders $m$ and $n$ respectively. We show that for a connected graph $G_1$ and an arbitrary graph $G_2$ having $l\\geq 1$ components $G_2^1$, $G_2^2$, ... $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02053","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.02053","created_at":"2026-05-18T01:37:08.722586+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.02053v1","created_at":"2026-05-18T01:37:08.722586+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02053","created_at":"2026-05-18T01:37:08.722586+00:00"},{"alias_kind":"pith_short_12","alias_value":"BPL7UKIKD2KV","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BPL7UKIKD2KVKJQD","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BPL7UKIK","created_at":"2026-05-18T12:29:14.074870+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/BPL7UKIKD2KVKJQDQKXBJA2SZ3","json":"https://pith.science/pith/BPL7UKIKD2KVKJQDQKXBJA2SZ3.json","graph_json":"https://pith.science/api/pith-number/BPL7UKIKD2KVKJQDQKXBJA2SZ3/graph.json","events_json":"https://pith.science/api/pith-number/BPL7UKIKD2KVKJQDQKXBJA2SZ3/events.json","paper":"https://pith.science/paper/BPL7UKIK"},"agent_actions":{"view_html":"https://pith.science/pith/BPL7UKIKD2KVKJQDQKXBJA2SZ3","download_json":"https://pith.science/pith/BPL7UKIKD2KVKJQDQKXBJA2SZ3.json","view_paper":"https://pith.science/paper/BPL7UKIK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.02053&json=true","fetch_graph":"https://pith.science/api/pith-number/BPL7UKIKD2KVKJQDQKXBJA2SZ3/graph.json","fetch_events":"https://pith.science/api/pith-number/BPL7UKIKD2KVKJQDQKXBJA2SZ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BPL7UKIKD2KVKJQDQKXBJA2SZ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BPL7UKIKD2KVKJQDQKXBJA2SZ3/action/storage_attestation","attest_author":"https://pith.science/pith/BPL7UKIKD2KVKJQDQKXBJA2SZ3/action/author_attestation","sign_citation":"https://pith.science/pith/BPL7UKIKD2KVKJQDQKXBJA2SZ3/action/citation_signature","submit_replication":"https://pith.science/pith/BPL7UKIKD2KVKJQDQKXBJA2SZ3/action/replication_record"}},"created_at":"2026-05-18T01:37:08.722586+00:00","updated_at":"2026-05-18T01:37:08.722586+00:00"}