{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BPL7UKIKD2KVKJQDQKXBJA2SZ3","short_pith_number":"pith:BPL7UKIK","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"},"canonical_sha256":"0bd7fa290a1e9555260382ae148352ced8c57a63240dc586f93ef2862deb1f38","source":{"kind":"arxiv","id":"1507.02053","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02053","created_at":"2026-05-18T01:37:08Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02053v1","created_at":"2026-05-18T01:37:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02053","created_at":"2026-05-18T01:37:08Z"},{"alias_kind":"pith_short_12","alias_value":"BPL7UKIKD2KV","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BPL7UKIKD2KVKJQD","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BPL7UKIK","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BPL7UKIKD2KVKJQDQKXBJA2SZ3","target":"record","payload":{"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"},"canonical_sha256":"0bd7fa290a1e9555260382ae148352ced8c57a63240dc586f93ef2862deb1f38","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"},"source_kind":"arxiv","source_id":"1507.02053","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:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9wpqETz1EtxpH4LJgnkSPyVsOhsHBSnoM3Mi4d2YpDzgzfMCTuTmImyY93n09YMzzgYYTGE7/v/eBkJc7zEBCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T20:28:31.734462Z"},"content_sha256":"d63f9af68fb2fa5360824df474cd43aa2fc5299b754757dc37512070d4eb46f1","schema_version":"1.0","event_id":"sha256:d63f9af68fb2fa5360824df474cd43aa2fc5299b754757dc37512070d4eb46f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BPL7UKIKD2KVKJQDQKXBJA2SZ3","target":"graph","payload":{"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"},"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:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"15/TmQlWmZVN6QdZ9ixCSsXx1vITbr1hrIyTTnRXVYucyRn1nm68omflNEsjzyZXRzgKLDETlfTnJadvW4SSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T20:28:31.735133Z"},"content_sha256":"569c4350e8547dbe7273f58c722d0604a0f7002446e2221054df91e7323010c8","schema_version":"1.0","event_id":"sha256:569c4350e8547dbe7273f58c722d0604a0f7002446e2221054df91e7323010c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BPL7UKIKD2KVKJQDQKXBJA2SZ3/bundle.json","state_url":"https://pith.science/pith/BPL7UKIKD2KVKJQDQKXBJA2SZ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BPL7UKIKD2KVKJQDQKXBJA2SZ3/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-01T20:28:31Z","links":{"resolver":"https://pith.science/pith/BPL7UKIKD2KVKJQDQKXBJA2SZ3","bundle":"https://pith.science/pith/BPL7UKIKD2KVKJQDQKXBJA2SZ3/bundle.json","state":"https://pith.science/pith/BPL7UKIKD2KVKJQDQKXBJA2SZ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BPL7UKIKD2KVKJQDQKXBJA2SZ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BPL7UKIKD2KVKJQDQKXBJA2SZ3","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":"bba0cb702e423543cefe7976ef3d64db8ae998c5ba4700d473e7fe5535082f14","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-08T07:46:02Z","title_canon_sha256":"8dbc0b88e7faac39b1f6324a09e5f8549255878427a08b4018d9743c9a28197c"},"schema_version":"1.0","source":{"id":"1507.02053","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02053","created_at":"2026-05-18T01:37:08Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02053v1","created_at":"2026-05-18T01:37:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02053","created_at":"2026-05-18T01:37:08Z"},{"alias_kind":"pith_short_12","alias_value":"BPL7UKIKD2KV","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BPL7UKIKD2KVKJQD","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BPL7UKIK","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:569c4350e8547dbe7273f58c722d0604a0f7002446e2221054df91e7323010c8","target":"graph","created_at":"2026-05-18T01:37:08Z","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":"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$, ... $","authors_text":"I. Irshad, I. Javaid, M. S. Aasi, M. Salman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-08T07:46:02Z","title":"On fixing sets of composition and corona product of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02053","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:d63f9af68fb2fa5360824df474cd43aa2fc5299b754757dc37512070d4eb46f1","target":"record","created_at":"2026-05-18T01:37:08Z","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":"bba0cb702e423543cefe7976ef3d64db8ae998c5ba4700d473e7fe5535082f14","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-08T07:46:02Z","title_canon_sha256":"8dbc0b88e7faac39b1f6324a09e5f8549255878427a08b4018d9743c9a28197c"},"schema_version":"1.0","source":{"id":"1507.02053","kind":"arxiv","version":1}},"canonical_sha256":"0bd7fa290a1e9555260382ae148352ced8c57a63240dc586f93ef2862deb1f38","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0bd7fa290a1e9555260382ae148352ced8c57a63240dc586f93ef2862deb1f38","first_computed_at":"2026-05-18T01:37:08.722511Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:08.722511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L4RoRvuMtWHqENbfaHRbkyyh08b5ma8ia+t6GLs9dZR0Tw0w5IpxP0r3gPidFKxwQejE0u5S4mvOQw9IzsJhDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:08.723085Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.02053","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d63f9af68fb2fa5360824df474cd43aa2fc5299b754757dc37512070d4eb46f1","sha256:569c4350e8547dbe7273f58c722d0604a0f7002446e2221054df91e7323010c8"],"state_sha256":"7053412b4918f7a81fb7c2808f086051898d3d9817d63f0a8ad8c9ec483cb13f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aRACwgVavB4/NCEQnKukgposdsZSHgYmir/VByy3/aIFmkYTv45tMU5dRvin7sUxSpHGC1USrgFuMoXlMaOkCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T20:28:31.738481Z","bundle_sha256":"6bc21375f7d1bcf814f9c33bfb7ac219f918ba03e0d33068d16f85c15a89833d"}}