{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:I2S6LNSNX6VII3FIODJTKWLRL7","short_pith_number":"pith:I2S6LNSN","canonical_record":{"source":{"id":"1812.09775","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-23T21:17:30Z","cross_cats_sorted":[],"title_canon_sha256":"20ced4422c44483ef058a7502b12d45fb799e76a53452941dfbf0411a00787ca","abstract_canon_sha256":"87c93f73267fccdcf16446d012dc92890989b6bb12d62ea2679e9d4057fbdfc5"},"schema_version":"1.0"},"canonical_sha256":"46a5e5b64dbfaa846ca870d33559715fca82b34f7b95882e6ce26f7940aad7be","source":{"kind":"arxiv","id":"1812.09775","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.09775","created_at":"2026-05-17T23:57:26Z"},{"alias_kind":"arxiv_version","alias_value":"1812.09775v1","created_at":"2026-05-17T23:57:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09775","created_at":"2026-05-17T23:57:26Z"},{"alias_kind":"pith_short_12","alias_value":"I2S6LNSNX6VI","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"I2S6LNSNX6VII3FI","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"I2S6LNSN","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:I2S6LNSNX6VII3FIODJTKWLRL7","target":"record","payload":{"canonical_record":{"source":{"id":"1812.09775","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-23T21:17:30Z","cross_cats_sorted":[],"title_canon_sha256":"20ced4422c44483ef058a7502b12d45fb799e76a53452941dfbf0411a00787ca","abstract_canon_sha256":"87c93f73267fccdcf16446d012dc92890989b6bb12d62ea2679e9d4057fbdfc5"},"schema_version":"1.0"},"canonical_sha256":"46a5e5b64dbfaa846ca870d33559715fca82b34f7b95882e6ce26f7940aad7be","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:26.820195Z","signature_b64":"BYTp0l8TH8FTWqRtA3IZelgnh9SOFXliZAaQx9qkvt6g8XjN4c2qw8XuLT1JTRDKXaca4ltMxFLSL8X+eNR6BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46a5e5b64dbfaa846ca870d33559715fca82b34f7b95882e6ce26f7940aad7be","last_reissued_at":"2026-05-17T23:57:26.819519Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:26.819519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.09775","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-17T23:57:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vjc9nc8qyCLenrkhcnPH+HrnxlFEX8JlSqWf/tiXDpTkYq3l5+5ydjXYL+bGMJqXCZHRtfrFPeo3f44rBjrRCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:39:02.729817Z"},"content_sha256":"518077b348a148b4eb125f6cc98b1108e463d23f25d958a26f5f2bd29b231fe7","schema_version":"1.0","event_id":"sha256:518077b348a148b4eb125f6cc98b1108e463d23f25d958a26f5f2bd29b231fe7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:I2S6LNSNX6VII3FIODJTKWLRL7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum Modulus of Independence Roots of Graphs and Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ben Cameron, Jason I.Brown","submitted_at":"2018-12-23T21:17:30Z","abstract_excerpt":"The independence polynomial of a graph is the generating polynomial for the number of independent sets of each size and its roots are called independence roots. We bound the maximum modulus, $\\mbox{maxmod}(n)$, of an independence root over all graphs on $n$ vertices and the maximum modulus, $\\mbox{maxmod}_{T}(n)$, of an independence root over all trees on $n$ vertices in terms of $n$. In particular, we show that\n  $$\\frac{\\log_3(\\mbox{maxmod}(n))}{n}=\\frac{1}{3}+o(1)$$\n  and $$\\frac{\\log_2(\\mbox{maxmod}_{T}(n))}{n}=\\frac{1}{2}+o(1).$$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09775","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-17T23:57:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"thX99bIil2KT7Fi0yO+RZsKN/9dn9xCN0YoaRbqSjLoDK/k/eITuGbI0MU6EJc06EyS6IHNMSJLr+s7faUMWDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:39:02.730499Z"},"content_sha256":"7c93517e4a7aeee2d58334c0beb232ad77bedb32c66432ab99ff4b545d3feff6","schema_version":"1.0","event_id":"sha256:7c93517e4a7aeee2d58334c0beb232ad77bedb32c66432ab99ff4b545d3feff6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I2S6LNSNX6VII3FIODJTKWLRL7/bundle.json","state_url":"https://pith.science/pith/I2S6LNSNX6VII3FIODJTKWLRL7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I2S6LNSNX6VII3FIODJTKWLRL7/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-27T15:39:02Z","links":{"resolver":"https://pith.science/pith/I2S6LNSNX6VII3FIODJTKWLRL7","bundle":"https://pith.science/pith/I2S6LNSNX6VII3FIODJTKWLRL7/bundle.json","state":"https://pith.science/pith/I2S6LNSNX6VII3FIODJTKWLRL7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I2S6LNSNX6VII3FIODJTKWLRL7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:I2S6LNSNX6VII3FIODJTKWLRL7","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":"87c93f73267fccdcf16446d012dc92890989b6bb12d62ea2679e9d4057fbdfc5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-23T21:17:30Z","title_canon_sha256":"20ced4422c44483ef058a7502b12d45fb799e76a53452941dfbf0411a00787ca"},"schema_version":"1.0","source":{"id":"1812.09775","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.09775","created_at":"2026-05-17T23:57:26Z"},{"alias_kind":"arxiv_version","alias_value":"1812.09775v1","created_at":"2026-05-17T23:57:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09775","created_at":"2026-05-17T23:57:26Z"},{"alias_kind":"pith_short_12","alias_value":"I2S6LNSNX6VI","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"I2S6LNSNX6VII3FI","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"I2S6LNSN","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:7c93517e4a7aeee2d58334c0beb232ad77bedb32c66432ab99ff4b545d3feff6","target":"graph","created_at":"2026-05-17T23:57:26Z","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":"The independence polynomial of a graph is the generating polynomial for the number of independent sets of each size and its roots are called independence roots. We bound the maximum modulus, $\\mbox{maxmod}(n)$, of an independence root over all graphs on $n$ vertices and the maximum modulus, $\\mbox{maxmod}_{T}(n)$, of an independence root over all trees on $n$ vertices in terms of $n$. In particular, we show that\n  $$\\frac{\\log_3(\\mbox{maxmod}(n))}{n}=\\frac{1}{3}+o(1)$$\n  and $$\\frac{\\log_2(\\mbox{maxmod}_{T}(n))}{n}=\\frac{1}{2}+o(1).$$","authors_text":"Ben Cameron, Jason I.Brown","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-23T21:17:30Z","title":"Maximum Modulus of Independence Roots of Graphs and Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09775","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:518077b348a148b4eb125f6cc98b1108e463d23f25d958a26f5f2bd29b231fe7","target":"record","created_at":"2026-05-17T23:57:26Z","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":"87c93f73267fccdcf16446d012dc92890989b6bb12d62ea2679e9d4057fbdfc5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-23T21:17:30Z","title_canon_sha256":"20ced4422c44483ef058a7502b12d45fb799e76a53452941dfbf0411a00787ca"},"schema_version":"1.0","source":{"id":"1812.09775","kind":"arxiv","version":1}},"canonical_sha256":"46a5e5b64dbfaa846ca870d33559715fca82b34f7b95882e6ce26f7940aad7be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46a5e5b64dbfaa846ca870d33559715fca82b34f7b95882e6ce26f7940aad7be","first_computed_at":"2026-05-17T23:57:26.819519Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:26.819519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BYTp0l8TH8FTWqRtA3IZelgnh9SOFXliZAaQx9qkvt6g8XjN4c2qw8XuLT1JTRDKXaca4ltMxFLSL8X+eNR6BA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:26.820195Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.09775","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:518077b348a148b4eb125f6cc98b1108e463d23f25d958a26f5f2bd29b231fe7","sha256:7c93517e4a7aeee2d58334c0beb232ad77bedb32c66432ab99ff4b545d3feff6"],"state_sha256":"5603514deda24df28e0c8d750389bc87bb8433440f13353eb13750ad819782fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LtrO7gzYTRvfGpxZTbspr9GdgjHCmSInop+2eABYEznxPb9D6TJBLx5SdbUds7flnWOoIoqWFZjV1WO8VsqSCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:39:02.733784Z","bundle_sha256":"2cf1e93b324991d7eb06750b8fd37858d000c9b697d8c9e696d83a6bbce59cb1"}}