{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:5THPLEZGKBQAZCGOASJQKLBJCO","short_pith_number":"pith:5THPLEZG","canonical_record":{"source":{"id":"1109.6275","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-28T17:22:01Z","cross_cats_sorted":[],"title_canon_sha256":"86e975463378c5d28456df050875ae7887067aa85f83a2be3f9a47d155a28f23","abstract_canon_sha256":"907831bc454b13410b9c274c37bc0f18555b0778acab83f730a20b6975f26b8c"},"schema_version":"1.0"},"canonical_sha256":"eccef5932650600c88ce0493052c2913bf4e28c45cd0837c9dbbd7dddc0a37da","source":{"kind":"arxiv","id":"1109.6275","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.6275","created_at":"2026-05-18T03:39:05Z"},{"alias_kind":"arxiv_version","alias_value":"1109.6275v2","created_at":"2026-05-18T03:39:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6275","created_at":"2026-05-18T03:39:05Z"},{"alias_kind":"pith_short_12","alias_value":"5THPLEZGKBQA","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5THPLEZGKBQAZCGO","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5THPLEZG","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:5THPLEZGKBQAZCGOASJQKLBJCO","target":"record","payload":{"canonical_record":{"source":{"id":"1109.6275","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-28T17:22:01Z","cross_cats_sorted":[],"title_canon_sha256":"86e975463378c5d28456df050875ae7887067aa85f83a2be3f9a47d155a28f23","abstract_canon_sha256":"907831bc454b13410b9c274c37bc0f18555b0778acab83f730a20b6975f26b8c"},"schema_version":"1.0"},"canonical_sha256":"eccef5932650600c88ce0493052c2913bf4e28c45cd0837c9dbbd7dddc0a37da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:05.361740Z","signature_b64":"CVdfMjB2blH6AIi/xFVvf7sxaq38wtfzAGelkJH49s5tynMqkvTCZShBxuRBybja7x3gIKbezgCdL893TUhzBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eccef5932650600c88ce0493052c2913bf4e28c45cd0837c9dbbd7dddc0a37da","last_reissued_at":"2026-05-18T03:39:05.361238Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:05.361238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.6275","source_version":2,"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:39:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yNNNnmLov4XYNK076fbQ/Y4yc+Zjkf3XanZk9oCsSmMfOmv+M/yzlJH6HGDA2nDYjSBX0EILU80OiiM3fzAYAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:19:54.433802Z"},"content_sha256":"9ac91e9618ec0352ffc2267562c83c359bd55024743408477b720449abf0f817","schema_version":"1.0","event_id":"sha256:9ac91e9618ec0352ffc2267562c83c359bd55024743408477b720449abf0f817"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:5THPLEZGKBQAZCGOASJQKLBJCO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A classification of all 1-Salem graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"James McKee, Lee Gumbrell","submitted_at":"2011-09-28T17:22:01Z","abstract_excerpt":"One way to study certain classes of polynomials is by considering examples that are attached to combinatorial objects. Any graph $G$ has an associated reciprocal polynomial $R_G$, and with two particular classes of reciprocal polynomials in mind one can ask the questions: (a) when is $R_G$ a product of cyclotomic polynomials (giving the cyclotomic graphs)? (b) when does $R_G$ have the minimal polynomial of a Salem number as its only non-cyclotomic factor (the non-trival Salem graphs)? Cyclotomic graphs were classified by Smith in 1970. Salem graphs are `spectrally close' to being cyclotomic, i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6275","kind":"arxiv","version":2},"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:39:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fzk/BRGetjjJyU/gOhZRPNunyCg7NfXvjR+gMy3f+iyBfh+I40hJkL4GKelPj0en/LVm3Ic8WRf42/vSn8ylAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:19:54.434391Z"},"content_sha256":"e37c8f41eabb7174885ac79faa946cd0670fc1837af29fc91cea103d9d1d46cb","schema_version":"1.0","event_id":"sha256:e37c8f41eabb7174885ac79faa946cd0670fc1837af29fc91cea103d9d1d46cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5THPLEZGKBQAZCGOASJQKLBJCO/bundle.json","state_url":"https://pith.science/pith/5THPLEZGKBQAZCGOASJQKLBJCO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5THPLEZGKBQAZCGOASJQKLBJCO/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-04T22:19:54Z","links":{"resolver":"https://pith.science/pith/5THPLEZGKBQAZCGOASJQKLBJCO","bundle":"https://pith.science/pith/5THPLEZGKBQAZCGOASJQKLBJCO/bundle.json","state":"https://pith.science/pith/5THPLEZGKBQAZCGOASJQKLBJCO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5THPLEZGKBQAZCGOASJQKLBJCO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:5THPLEZGKBQAZCGOASJQKLBJCO","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":"907831bc454b13410b9c274c37bc0f18555b0778acab83f730a20b6975f26b8c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-28T17:22:01Z","title_canon_sha256":"86e975463378c5d28456df050875ae7887067aa85f83a2be3f9a47d155a28f23"},"schema_version":"1.0","source":{"id":"1109.6275","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.6275","created_at":"2026-05-18T03:39:05Z"},{"alias_kind":"arxiv_version","alias_value":"1109.6275v2","created_at":"2026-05-18T03:39:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6275","created_at":"2026-05-18T03:39:05Z"},{"alias_kind":"pith_short_12","alias_value":"5THPLEZGKBQA","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5THPLEZGKBQAZCGO","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5THPLEZG","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:e37c8f41eabb7174885ac79faa946cd0670fc1837af29fc91cea103d9d1d46cb","target":"graph","created_at":"2026-05-18T03:39:05Z","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":"One way to study certain classes of polynomials is by considering examples that are attached to combinatorial objects. Any graph $G$ has an associated reciprocal polynomial $R_G$, and with two particular classes of reciprocal polynomials in mind one can ask the questions: (a) when is $R_G$ a product of cyclotomic polynomials (giving the cyclotomic graphs)? (b) when does $R_G$ have the minimal polynomial of a Salem number as its only non-cyclotomic factor (the non-trival Salem graphs)? Cyclotomic graphs were classified by Smith in 1970. Salem graphs are `spectrally close' to being cyclotomic, i","authors_text":"James McKee, Lee Gumbrell","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-28T17:22:01Z","title":"A classification of all 1-Salem graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6275","kind":"arxiv","version":2},"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:9ac91e9618ec0352ffc2267562c83c359bd55024743408477b720449abf0f817","target":"record","created_at":"2026-05-18T03:39:05Z","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":"907831bc454b13410b9c274c37bc0f18555b0778acab83f730a20b6975f26b8c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-28T17:22:01Z","title_canon_sha256":"86e975463378c5d28456df050875ae7887067aa85f83a2be3f9a47d155a28f23"},"schema_version":"1.0","source":{"id":"1109.6275","kind":"arxiv","version":2}},"canonical_sha256":"eccef5932650600c88ce0493052c2913bf4e28c45cd0837c9dbbd7dddc0a37da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eccef5932650600c88ce0493052c2913bf4e28c45cd0837c9dbbd7dddc0a37da","first_computed_at":"2026-05-18T03:39:05.361238Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:39:05.361238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CVdfMjB2blH6AIi/xFVvf7sxaq38wtfzAGelkJH49s5tynMqkvTCZShBxuRBybja7x3gIKbezgCdL893TUhzBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:39:05.361740Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.6275","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ac91e9618ec0352ffc2267562c83c359bd55024743408477b720449abf0f817","sha256:e37c8f41eabb7174885ac79faa946cd0670fc1837af29fc91cea103d9d1d46cb"],"state_sha256":"50bbd1b448d649b867c6affcfaa6cd8c2b8d697308dff82bcaef758e726b0d05"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"urhVIT20Jb3LH7yUMqedgCWLjc9bjckU1hlrXmaT2/Ew6XPy/ZTJY6x2E0cEfBEXTVufCM+BKbV6YZTUDIwqCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:19:54.437696Z","bundle_sha256":"b82737557bafc8a3904ca49a7cbf70e465c6ce588e3594062383d406ed7d068a"}}