{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:VOM6ZV2O2QY66N5A6JNOT3QIGG","short_pith_number":"pith:VOM6ZV2O","schema_version":"1.0","canonical_sha256":"ab99ecd74ed431ef37a0f25ae9ee0831b42bdb33ad40a4099752bf6d9bb5b6fe","source":{"kind":"arxiv","id":"1406.3844","version":1},"attestation_state":"computed","paper":{"title":"Distinguishing Number for some Circulant Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kahina Meslem, Souad Slimani, Sylvain Gravier","submitted_at":"2014-06-15T19:04:20Z","abstract_excerpt":"Introduced by Albertson et al. \\cite{albertson}, the distinguishing number $D(G)$ of a graph $G$ is the least integer $r$ such that there is a $r$-labeling of the vertices of $G$ that is not preserved by any nontrivial automorphism of $G$. Most of graphs studied in literature have 2 as a distinguishing number value except complete, multipartite graphs or cartesian product of complete graphs depending on $n$. In this paper, we study circulant graphs of order $n$ where the adjacency is defined using a symmetric subset $A$ of $\\mathbb{Z}_n$, called generator. We give a construction of a family of"},"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":"1406.3844","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-15T19:04:20Z","cross_cats_sorted":[],"title_canon_sha256":"c73c3ceb58e887e539dec2f1a547b0557c177f02dd5f66ee4c2c1cc91161ed6e","abstract_canon_sha256":"83829e1ca474bf475538389c8c6cb1fe4e5d9de73e025324362b2f632d0e655b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:39.626763Z","signature_b64":"IGKZVnEXIqPLDt1Bf6/rcjRiSPo4wIswG4AxwwtxdFury9dF54jmLaQKPKpCJ5//sZdg1eJpeM3z6d0wAAWRDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab99ecd74ed431ef37a0f25ae9ee0831b42bdb33ad40a4099752bf6d9bb5b6fe","last_reissued_at":"2026-05-18T02:49:39.626439Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:39.626439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distinguishing Number for some Circulant Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kahina Meslem, Souad Slimani, Sylvain Gravier","submitted_at":"2014-06-15T19:04:20Z","abstract_excerpt":"Introduced by Albertson et al. \\cite{albertson}, the distinguishing number $D(G)$ of a graph $G$ is the least integer $r$ such that there is a $r$-labeling of the vertices of $G$ that is not preserved by any nontrivial automorphism of $G$. Most of graphs studied in literature have 2 as a distinguishing number value except complete, multipartite graphs or cartesian product of complete graphs depending on $n$. In this paper, we study circulant graphs of order $n$ where the adjacency is defined using a symmetric subset $A$ of $\\mathbb{Z}_n$, called generator. We give a construction of a family of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3844","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":"1406.3844","created_at":"2026-05-18T02:49:39.626491+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.3844v1","created_at":"2026-05-18T02:49:39.626491+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3844","created_at":"2026-05-18T02:49:39.626491+00:00"},{"alias_kind":"pith_short_12","alias_value":"VOM6ZV2O2QY6","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"VOM6ZV2O2QY66N5A","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"VOM6ZV2O","created_at":"2026-05-18T12:28:54.890064+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/VOM6ZV2O2QY66N5A6JNOT3QIGG","json":"https://pith.science/pith/VOM6ZV2O2QY66N5A6JNOT3QIGG.json","graph_json":"https://pith.science/api/pith-number/VOM6ZV2O2QY66N5A6JNOT3QIGG/graph.json","events_json":"https://pith.science/api/pith-number/VOM6ZV2O2QY66N5A6JNOT3QIGG/events.json","paper":"https://pith.science/paper/VOM6ZV2O"},"agent_actions":{"view_html":"https://pith.science/pith/VOM6ZV2O2QY66N5A6JNOT3QIGG","download_json":"https://pith.science/pith/VOM6ZV2O2QY66N5A6JNOT3QIGG.json","view_paper":"https://pith.science/paper/VOM6ZV2O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.3844&json=true","fetch_graph":"https://pith.science/api/pith-number/VOM6ZV2O2QY66N5A6JNOT3QIGG/graph.json","fetch_events":"https://pith.science/api/pith-number/VOM6ZV2O2QY66N5A6JNOT3QIGG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VOM6ZV2O2QY66N5A6JNOT3QIGG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VOM6ZV2O2QY66N5A6JNOT3QIGG/action/storage_attestation","attest_author":"https://pith.science/pith/VOM6ZV2O2QY66N5A6JNOT3QIGG/action/author_attestation","sign_citation":"https://pith.science/pith/VOM6ZV2O2QY66N5A6JNOT3QIGG/action/citation_signature","submit_replication":"https://pith.science/pith/VOM6ZV2O2QY66N5A6JNOT3QIGG/action/replication_record"}},"created_at":"2026-05-18T02:49:39.626491+00:00","updated_at":"2026-05-18T02:49:39.626491+00:00"}