{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7GTTHWMZIFPL6IQLBHHE6RHQMA","short_pith_number":"pith:7GTTHWMZ","schema_version":"1.0","canonical_sha256":"f9a733d999415ebf220b09ce4f44f0600f7f3c6f3242d68c4fa27461c95121df","source":{"kind":"arxiv","id":"1707.01823","version":1},"attestation_state":"computed","paper":{"title":"List-Distinguishing Cartesian Products of Cliques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Ferrara, Paul Wenger, Sogol Jahanbekam, Zoltan Furedi","submitted_at":"2017-07-06T14:49:52Z","abstract_excerpt":"The distinguishing number of a graph $G$, denoted $D(G)$, is the minimum number of colors needed to produce a coloring of the vertices of $G$ so that every nontrivial isomorphism interchanges vertices of different colors. A list assignment $L$ on a graph $G$ is a function that assigns each vertex of $G$ a set of colors. An $L$-coloring of $G$ is a coloring in which each vertex is colored with a color from $L(v)$. The list distinguishing number of $G$, denoted $D_{\\ell}(G)$ is the minimum $k$ such that every list assignment $L$ that assigns a list of size at least $k$ to every vertex permits a "},"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":"1707.01823","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-06T14:49:52Z","cross_cats_sorted":[],"title_canon_sha256":"09c194122c7d2f966fe3d0046f94290516223e31214b4db6d0eda0cf9547ea31","abstract_canon_sha256":"887c6ede2c4b0004aa24ecd74e3b03f494567ee65d0530137d0d1a479543d242"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:47.321233Z","signature_b64":"NJm5nBvOvqc9nD6fosSCeGd+RWtf4WpnALthnt3H+oHuW5KtDwMDJG7rSROS+HIoLwijFnL6Qvu+LSBj0otCAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9a733d999415ebf220b09ce4f44f0600f7f3c6f3242d68c4fa27461c95121df","last_reissued_at":"2026-05-18T00:40:47.320613Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:47.320613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"List-Distinguishing Cartesian Products of Cliques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Ferrara, Paul Wenger, Sogol Jahanbekam, Zoltan Furedi","submitted_at":"2017-07-06T14:49:52Z","abstract_excerpt":"The distinguishing number of a graph $G$, denoted $D(G)$, is the minimum number of colors needed to produce a coloring of the vertices of $G$ so that every nontrivial isomorphism interchanges vertices of different colors. A list assignment $L$ on a graph $G$ is a function that assigns each vertex of $G$ a set of colors. An $L$-coloring of $G$ is a coloring in which each vertex is colored with a color from $L(v)$. The list distinguishing number of $G$, denoted $D_{\\ell}(G)$ is the minimum $k$ such that every list assignment $L$ that assigns a list of size at least $k$ to every vertex permits a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01823","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":"1707.01823","created_at":"2026-05-18T00:40:47.320701+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.01823v1","created_at":"2026-05-18T00:40:47.320701+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01823","created_at":"2026-05-18T00:40:47.320701+00:00"},{"alias_kind":"pith_short_12","alias_value":"7GTTHWMZIFPL","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7GTTHWMZIFPL6IQL","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7GTTHWMZ","created_at":"2026-05-18T12:31:05.417338+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/7GTTHWMZIFPL6IQLBHHE6RHQMA","json":"https://pith.science/pith/7GTTHWMZIFPL6IQLBHHE6RHQMA.json","graph_json":"https://pith.science/api/pith-number/7GTTHWMZIFPL6IQLBHHE6RHQMA/graph.json","events_json":"https://pith.science/api/pith-number/7GTTHWMZIFPL6IQLBHHE6RHQMA/events.json","paper":"https://pith.science/paper/7GTTHWMZ"},"agent_actions":{"view_html":"https://pith.science/pith/7GTTHWMZIFPL6IQLBHHE6RHQMA","download_json":"https://pith.science/pith/7GTTHWMZIFPL6IQLBHHE6RHQMA.json","view_paper":"https://pith.science/paper/7GTTHWMZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.01823&json=true","fetch_graph":"https://pith.science/api/pith-number/7GTTHWMZIFPL6IQLBHHE6RHQMA/graph.json","fetch_events":"https://pith.science/api/pith-number/7GTTHWMZIFPL6IQLBHHE6RHQMA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7GTTHWMZIFPL6IQLBHHE6RHQMA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7GTTHWMZIFPL6IQLBHHE6RHQMA/action/storage_attestation","attest_author":"https://pith.science/pith/7GTTHWMZIFPL6IQLBHHE6RHQMA/action/author_attestation","sign_citation":"https://pith.science/pith/7GTTHWMZIFPL6IQLBHHE6RHQMA/action/citation_signature","submit_replication":"https://pith.science/pith/7GTTHWMZIFPL6IQLBHHE6RHQMA/action/replication_record"}},"created_at":"2026-05-18T00:40:47.320701+00:00","updated_at":"2026-05-18T00:40:47.320701+00:00"}