{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OJQPUDJ2PMBYWAQX43V5ZH6I7O","short_pith_number":"pith:OJQPUDJ2","canonical_record":{"source":{"id":"1602.03741","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-11T14:18:10Z","cross_cats_sorted":[],"title_canon_sha256":"3db87bdc20899de59044ff485d002f43b2a355affd6b007bd6529da0ee2e546d","abstract_canon_sha256":"5c3a9ca7da9990acc3d22c6836f0dd8ab32073fcc291512ed6aeb087312f0927"},"schema_version":"1.0"},"canonical_sha256":"7260fa0d3a7b038b0217e6ebdc9fc8fba794ba766d2422f94037033bb1de8fc0","source":{"kind":"arxiv","id":"1602.03741","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.03741","created_at":"2026-05-18T01:20:56Z"},{"alias_kind":"arxiv_version","alias_value":"1602.03741v1","created_at":"2026-05-18T01:20:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03741","created_at":"2026-05-18T01:20:56Z"},{"alias_kind":"pith_short_12","alias_value":"OJQPUDJ2PMBY","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OJQPUDJ2PMBYWAQX","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OJQPUDJ2","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OJQPUDJ2PMBYWAQX43V5ZH6I7O","target":"record","payload":{"canonical_record":{"source":{"id":"1602.03741","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-11T14:18:10Z","cross_cats_sorted":[],"title_canon_sha256":"3db87bdc20899de59044ff485d002f43b2a355affd6b007bd6529da0ee2e546d","abstract_canon_sha256":"5c3a9ca7da9990acc3d22c6836f0dd8ab32073fcc291512ed6aeb087312f0927"},"schema_version":"1.0"},"canonical_sha256":"7260fa0d3a7b038b0217e6ebdc9fc8fba794ba766d2422f94037033bb1de8fc0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:56.682173Z","signature_b64":"RZ+nvfAN5YVeCkYYUGtILVdqFKIYkJEIa/XMdBuxQgaEAsFR102WHpVhzGRufLcqm67E8x+jf1O0l5WqmW+cBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7260fa0d3a7b038b0217e6ebdc9fc8fba794ba766d2422f94037033bb1de8fc0","last_reissued_at":"2026-05-18T01:20:56.681724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:56.681724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.03741","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:20:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cmw+HEurHYK6lbSOMQLbXvuX1jA2oYkI3l+lxebZKM+sjnDc69xDzPFkoNA/d+xed+qSJajx2+EjIZ+rm6NFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T17:11:15.319337Z"},"content_sha256":"0b8a55a06cd31d63d6959ab357d46c00f9502dcd1c9e4370959645268f49462f","schema_version":"1.0","event_id":"sha256:0b8a55a06cd31d63d6959ab357d46c00f9502dcd1c9e4370959645268f49462f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OJQPUDJ2PMBYWAQX43V5ZH6I7O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The List Distinguishing Number of Kneser Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Niranjan Balachandran, Sajith Padinhatteeri","submitted_at":"2016-02-11T14:18:10Z","abstract_excerpt":"A graph $G$ is said to be $k$-distinguishable if the vertex set can be colored using $k$ colors such that no non-trivial automorphism fixes every color class, and the distinguishing number $D(G)$ is the least integer $k$ for which $G$ is $k$-distinguishable. If for each $v\\in V(G)$ we have a list $L(v)$ of colors, and we stipulate that the color assigned to vertex $v$ comes from its list $L(v)$ then $G$ is said to be $\\mathcal{L}$-distinguishable where $\\mathcal{L} =\\{L(v)\\}_{v\\in V(G)}$. The list distinguishing number of a graph, denoted $D_l(G)$, is the minimum integer $k$ such that every co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03741","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:20:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"174Jeq6juTPPzbWRDCzNV9IXFPqtbaio7vSAat7PtFAsI0JirkyK188sG8/1TfdmOm2LHZluEr3r+y79CfHRAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T17:11:15.319692Z"},"content_sha256":"6e5e0e3d05ef0a8dcd59cf5e626cdeed2a08aee8cb106cfb51f38f9bb29e7004","schema_version":"1.0","event_id":"sha256:6e5e0e3d05ef0a8dcd59cf5e626cdeed2a08aee8cb106cfb51f38f9bb29e7004"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OJQPUDJ2PMBYWAQX43V5ZH6I7O/bundle.json","state_url":"https://pith.science/pith/OJQPUDJ2PMBYWAQX43V5ZH6I7O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OJQPUDJ2PMBYWAQX43V5ZH6I7O/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-06-29T17:11:15Z","links":{"resolver":"https://pith.science/pith/OJQPUDJ2PMBYWAQX43V5ZH6I7O","bundle":"https://pith.science/pith/OJQPUDJ2PMBYWAQX43V5ZH6I7O/bundle.json","state":"https://pith.science/pith/OJQPUDJ2PMBYWAQX43V5ZH6I7O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OJQPUDJ2PMBYWAQX43V5ZH6I7O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OJQPUDJ2PMBYWAQX43V5ZH6I7O","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":"5c3a9ca7da9990acc3d22c6836f0dd8ab32073fcc291512ed6aeb087312f0927","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-11T14:18:10Z","title_canon_sha256":"3db87bdc20899de59044ff485d002f43b2a355affd6b007bd6529da0ee2e546d"},"schema_version":"1.0","source":{"id":"1602.03741","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.03741","created_at":"2026-05-18T01:20:56Z"},{"alias_kind":"arxiv_version","alias_value":"1602.03741v1","created_at":"2026-05-18T01:20:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03741","created_at":"2026-05-18T01:20:56Z"},{"alias_kind":"pith_short_12","alias_value":"OJQPUDJ2PMBY","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OJQPUDJ2PMBYWAQX","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OJQPUDJ2","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:6e5e0e3d05ef0a8dcd59cf5e626cdeed2a08aee8cb106cfb51f38f9bb29e7004","target":"graph","created_at":"2026-05-18T01:20:56Z","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 graph $G$ is said to be $k$-distinguishable if the vertex set can be colored using $k$ colors such that no non-trivial automorphism fixes every color class, and the distinguishing number $D(G)$ is the least integer $k$ for which $G$ is $k$-distinguishable. If for each $v\\in V(G)$ we have a list $L(v)$ of colors, and we stipulate that the color assigned to vertex $v$ comes from its list $L(v)$ then $G$ is said to be $\\mathcal{L}$-distinguishable where $\\mathcal{L} =\\{L(v)\\}_{v\\in V(G)}$. The list distinguishing number of a graph, denoted $D_l(G)$, is the minimum integer $k$ such that every co","authors_text":"Niranjan Balachandran, Sajith Padinhatteeri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-11T14:18:10Z","title":"The List Distinguishing Number of Kneser Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03741","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:0b8a55a06cd31d63d6959ab357d46c00f9502dcd1c9e4370959645268f49462f","target":"record","created_at":"2026-05-18T01:20:56Z","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":"5c3a9ca7da9990acc3d22c6836f0dd8ab32073fcc291512ed6aeb087312f0927","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-11T14:18:10Z","title_canon_sha256":"3db87bdc20899de59044ff485d002f43b2a355affd6b007bd6529da0ee2e546d"},"schema_version":"1.0","source":{"id":"1602.03741","kind":"arxiv","version":1}},"canonical_sha256":"7260fa0d3a7b038b0217e6ebdc9fc8fba794ba766d2422f94037033bb1de8fc0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7260fa0d3a7b038b0217e6ebdc9fc8fba794ba766d2422f94037033bb1de8fc0","first_computed_at":"2026-05-18T01:20:56.681724Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:56.681724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RZ+nvfAN5YVeCkYYUGtILVdqFKIYkJEIa/XMdBuxQgaEAsFR102WHpVhzGRufLcqm67E8x+jf1O0l5WqmW+cBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:56.682173Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.03741","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b8a55a06cd31d63d6959ab357d46c00f9502dcd1c9e4370959645268f49462f","sha256:6e5e0e3d05ef0a8dcd59cf5e626cdeed2a08aee8cb106cfb51f38f9bb29e7004"],"state_sha256":"d35a1922a5bd5afa3871e0e2fc615ffa40507097a3b8bf9142aa9ac747d1b1ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JJa2knvQaVXnf7ODgopfDLvExmTHd9a24viLpTm5e58hipVsHe9n7AdDjA/PJeynflcaDAN3lWhJ6Ub6JJw8CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T17:11:15.321629Z","bundle_sha256":"8ab9728dab58325989c6e8b0b024bf4ec1ea9aa3bae5030b17fc72ab836e6fc6"}}