{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:AJCYSHKL5MOUCDWWRR2DFHCLDS","short_pith_number":"pith:AJCYSHKL","canonical_record":{"source":{"id":"1401.7183","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-28T13:56:51Z","cross_cats_sorted":[],"title_canon_sha256":"8339029aaa9ff8a0cc9f70215d47b5165e16ce34305df55ac995c3467d4b7cc8","abstract_canon_sha256":"574502dd478cd7f0548a147eb3840cc3c021362266829847318b2cf2b3d0256b"},"schema_version":"1.0"},"canonical_sha256":"0245891d4beb1d410ed68c74329c4b1c89bb527ed2a5e519d444890178984950","source":{"kind":"arxiv","id":"1401.7183","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.7183","created_at":"2026-05-18T03:00:50Z"},{"alias_kind":"arxiv_version","alias_value":"1401.7183v1","created_at":"2026-05-18T03:00:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7183","created_at":"2026-05-18T03:00:50Z"},{"alias_kind":"pith_short_12","alias_value":"AJCYSHKL5MOU","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AJCYSHKL5MOUCDWW","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AJCYSHKL","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:AJCYSHKL5MOUCDWWRR2DFHCLDS","target":"record","payload":{"canonical_record":{"source":{"id":"1401.7183","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-28T13:56:51Z","cross_cats_sorted":[],"title_canon_sha256":"8339029aaa9ff8a0cc9f70215d47b5165e16ce34305df55ac995c3467d4b7cc8","abstract_canon_sha256":"574502dd478cd7f0548a147eb3840cc3c021362266829847318b2cf2b3d0256b"},"schema_version":"1.0"},"canonical_sha256":"0245891d4beb1d410ed68c74329c4b1c89bb527ed2a5e519d444890178984950","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:50.666724Z","signature_b64":"zoQYh91Hd3BqjqEA5MabSvai8XufFgVD8YEMkwHWJp7mTr62NScINv4/4kGz5prdRUEseT+0egPYndc2pKCZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0245891d4beb1d410ed68c74329c4b1c89bb527ed2a5e519d444890178984950","last_reissued_at":"2026-05-18T03:00:50.666227Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:50.666227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.7183","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-18T03:00:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"frt/D3csV2QGeDtMsmqtHbAWmEImbIogo4ZGbbxUycUDnh2oMGfFvjz88lfWC+OqtlUbHKXP9MIW9kr9rsb7AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:09:21.743033Z"},"content_sha256":"7c9d11c38dcd54f67b500401969e51cffc650a253ec8e008bc9d08d599778254","schema_version":"1.0","event_id":"sha256:7c9d11c38dcd54f67b500401969e51cffc650a253ec8e008bc9d08d599778254"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:AJCYSHKL5MOUCDWWRR2DFHCLDS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the independence ratio of distance graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. J. Radcliff, David Galvin, Derrick Stolee, James M. Carraher, Stephen G. Hartke","submitted_at":"2014-01-28T13:56:51Z","abstract_excerpt":"A distance graph is an undirected graph on the integers where two integers are adjacent if their difference is in a prescribed distance set. The independence ratio of a distance graph $G$ is the maximum density of an independent set in $G$. Lih, Liu, and Zhu [Star extremal circulant graphs, SIAM J. Discrete Math. 12 (1999) 491--499] showed that the independence ratio is equal to the inverse of the fractional chromatic number, thus relating the concept to the well studied question of finding the chromatic number of distance graphs.\n  We prove that the independence ratio of a distance graph is a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7183","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-18T03:00:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J6SoFJwW/BOGUGPYdet9ewIXd4SMvYBBj3IiG23ySzeFXUghCKb4KIetAGoJUUamrzovh+hbbqI62FVIEk2nCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:09:21.743654Z"},"content_sha256":"90fa2b17bad7cebc69fbb666d2d94af0db48033ee2a42eb10793dcc657ad7671","schema_version":"1.0","event_id":"sha256:90fa2b17bad7cebc69fbb666d2d94af0db48033ee2a42eb10793dcc657ad7671"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AJCYSHKL5MOUCDWWRR2DFHCLDS/bundle.json","state_url":"https://pith.science/pith/AJCYSHKL5MOUCDWWRR2DFHCLDS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AJCYSHKL5MOUCDWWRR2DFHCLDS/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-05-30T07:09:21Z","links":{"resolver":"https://pith.science/pith/AJCYSHKL5MOUCDWWRR2DFHCLDS","bundle":"https://pith.science/pith/AJCYSHKL5MOUCDWWRR2DFHCLDS/bundle.json","state":"https://pith.science/pith/AJCYSHKL5MOUCDWWRR2DFHCLDS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AJCYSHKL5MOUCDWWRR2DFHCLDS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:AJCYSHKL5MOUCDWWRR2DFHCLDS","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":"574502dd478cd7f0548a147eb3840cc3c021362266829847318b2cf2b3d0256b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-28T13:56:51Z","title_canon_sha256":"8339029aaa9ff8a0cc9f70215d47b5165e16ce34305df55ac995c3467d4b7cc8"},"schema_version":"1.0","source":{"id":"1401.7183","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.7183","created_at":"2026-05-18T03:00:50Z"},{"alias_kind":"arxiv_version","alias_value":"1401.7183v1","created_at":"2026-05-18T03:00:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7183","created_at":"2026-05-18T03:00:50Z"},{"alias_kind":"pith_short_12","alias_value":"AJCYSHKL5MOU","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AJCYSHKL5MOUCDWW","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AJCYSHKL","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:90fa2b17bad7cebc69fbb666d2d94af0db48033ee2a42eb10793dcc657ad7671","target":"graph","created_at":"2026-05-18T03:00:50Z","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 distance graph is an undirected graph on the integers where two integers are adjacent if their difference is in a prescribed distance set. The independence ratio of a distance graph $G$ is the maximum density of an independent set in $G$. Lih, Liu, and Zhu [Star extremal circulant graphs, SIAM J. Discrete Math. 12 (1999) 491--499] showed that the independence ratio is equal to the inverse of the fractional chromatic number, thus relating the concept to the well studied question of finding the chromatic number of distance graphs.\n  We prove that the independence ratio of a distance graph is a","authors_text":"A. J. Radcliff, David Galvin, Derrick Stolee, James M. Carraher, Stephen G. Hartke","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-28T13:56:51Z","title":"On the independence ratio of distance graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7183","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:7c9d11c38dcd54f67b500401969e51cffc650a253ec8e008bc9d08d599778254","target":"record","created_at":"2026-05-18T03:00:50Z","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":"574502dd478cd7f0548a147eb3840cc3c021362266829847318b2cf2b3d0256b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-28T13:56:51Z","title_canon_sha256":"8339029aaa9ff8a0cc9f70215d47b5165e16ce34305df55ac995c3467d4b7cc8"},"schema_version":"1.0","source":{"id":"1401.7183","kind":"arxiv","version":1}},"canonical_sha256":"0245891d4beb1d410ed68c74329c4b1c89bb527ed2a5e519d444890178984950","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0245891d4beb1d410ed68c74329c4b1c89bb527ed2a5e519d444890178984950","first_computed_at":"2026-05-18T03:00:50.666227Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:50.666227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zoQYh91Hd3BqjqEA5MabSvai8XufFgVD8YEMkwHWJp7mTr62NScINv4/4kGz5prdRUEseT+0egPYndc2pKCZDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:50.666724Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.7183","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c9d11c38dcd54f67b500401969e51cffc650a253ec8e008bc9d08d599778254","sha256:90fa2b17bad7cebc69fbb666d2d94af0db48033ee2a42eb10793dcc657ad7671"],"state_sha256":"2e9bceaefd4d1f18c51d8b31ddc276288e4c5ffb2779509b5d8815594222f2c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x7Wb+yRDSDRf2o8dj9bCLeYOrTfjHBrWcDuUpPd19ePcmHRQTTXDeYasN30HcAoa1ZrYWasJPmi9G9drw5Q2CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:09:21.746741Z","bundle_sha256":"033cd950252c8862900ff4520dcaaea6eb6300b1ba3c55d138a408c96458e9ba"}}