{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:N6HHZUEFZMCURFUEEGPVO7EWPZ","short_pith_number":"pith:N6HHZUEF","canonical_record":{"source":{"id":"2411.14791","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.DS","submitted_at":"2024-11-22T08:22:40Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"3292dfd970773077c9182eddc91295ff86d835248f8c6d93129bfb0ae2d1fff7","abstract_canon_sha256":"488248aebec12db7e8ac2d1ab9dd2aa6e9e3ed50a2fc9dcfb206049f0579901e"},"schema_version":"1.0"},"canonical_sha256":"6f8e7cd085cb05489684219f577c967e7d952c889147570b9c3648f4f78717c0","source":{"kind":"arxiv","id":"2411.14791","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.14791","created_at":"2026-07-05T09:39:11Z"},{"alias_kind":"arxiv_version","alias_value":"2411.14791v1","created_at":"2026-07-05T09:39:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14791","created_at":"2026-07-05T09:39:11Z"},{"alias_kind":"pith_short_12","alias_value":"N6HHZUEFZMCU","created_at":"2026-07-05T09:39:11Z"},{"alias_kind":"pith_short_16","alias_value":"N6HHZUEFZMCURFUE","created_at":"2026-07-05T09:39:11Z"},{"alias_kind":"pith_short_8","alias_value":"N6HHZUEF","created_at":"2026-07-05T09:39:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:N6HHZUEFZMCURFUEEGPVO7EWPZ","target":"record","payload":{"canonical_record":{"source":{"id":"2411.14791","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.DS","submitted_at":"2024-11-22T08:22:40Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"3292dfd970773077c9182eddc91295ff86d835248f8c6d93129bfb0ae2d1fff7","abstract_canon_sha256":"488248aebec12db7e8ac2d1ab9dd2aa6e9e3ed50a2fc9dcfb206049f0579901e"},"schema_version":"1.0"},"canonical_sha256":"6f8e7cd085cb05489684219f577c967e7d952c889147570b9c3648f4f78717c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:39:11.934413Z","signature_b64":"yv32xn12/SqWs7GF+Cimw91hIAEwXF6z9F6AsMv72mU08Kkvt88RMcnFV0LekQ+wbxmSpFo2Jh7yKQ8V4hmEDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f8e7cd085cb05489684219f577c967e7d952c889147570b9c3648f4f78717c0","last_reissued_at":"2026-07-05T09:39:11.934009Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:39:11.934009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.14791","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-07-05T09:39:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CvdMiOyCwnWNFvlcM6jWHLqTZcyx3lCxC9RSZDgiEV6bS1a59IuTeXsdNzvmmR8AuQ3tOWhmxhknKqRl2F7aCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T16:24:55.143756Z"},"content_sha256":"22789dfb24be001ddd0d422aec69894551591683e25c7cde593d425f38007ad2","schema_version":"1.0","event_id":"sha256:22789dfb24be001ddd0d422aec69894551591683e25c7cde593d425f38007ad2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:N6HHZUEFZMCURFUEEGPVO7EWPZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The independence polynomial on recursive sequences of graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.DS","authors_text":"Han Peters, Mikhail Hlushchanka","submitted_at":"2024-11-22T08:22:40Z","abstract_excerpt":"We study the zero sets of the independence polynomial on recursive sequences of graphs. We prove that for a maximally independent starting graph and a stable and expanding recursion algorithm, the zeros of the independence polynomial are uniformly bounded. Each of the recursion algorithms leads to a rational dynamical system whose formula, degree and the dimension of the space it acts upon depend on the specific algorithm. Nevertheless, we demonstrate that the qualitative behavior of the dynamics exhibit universal features that can be exploited to draw conclusions about the zero sets."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14791","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.14791/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:39:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CdzoMMsgPvG4nzAqjN0XE9U25zh4wmjpBvUz6U7hPCIdnsjOgn3MrQiAYUicuB4oozj0kXSa0PvbUpPpPQ2/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T16:24:55.144381Z"},"content_sha256":"c44946009c86b9e8c266b9fa6bf50502b4c81822c99de95e33b4ab90ef355750","schema_version":"1.0","event_id":"sha256:c44946009c86b9e8c266b9fa6bf50502b4c81822c99de95e33b4ab90ef355750"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N6HHZUEFZMCURFUEEGPVO7EWPZ/bundle.json","state_url":"https://pith.science/pith/N6HHZUEFZMCURFUEEGPVO7EWPZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N6HHZUEFZMCURFUEEGPVO7EWPZ/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-08-09T16:24:55Z","links":{"resolver":"https://pith.science/pith/N6HHZUEFZMCURFUEEGPVO7EWPZ","bundle":"https://pith.science/pith/N6HHZUEFZMCURFUEEGPVO7EWPZ/bundle.json","state":"https://pith.science/pith/N6HHZUEFZMCURFUEEGPVO7EWPZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N6HHZUEFZMCURFUEEGPVO7EWPZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:N6HHZUEFZMCURFUEEGPVO7EWPZ","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":"488248aebec12db7e8ac2d1ab9dd2aa6e9e3ed50a2fc9dcfb206049f0579901e","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.DS","submitted_at":"2024-11-22T08:22:40Z","title_canon_sha256":"3292dfd970773077c9182eddc91295ff86d835248f8c6d93129bfb0ae2d1fff7"},"schema_version":"1.0","source":{"id":"2411.14791","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.14791","created_at":"2026-07-05T09:39:11Z"},{"alias_kind":"arxiv_version","alias_value":"2411.14791v1","created_at":"2026-07-05T09:39:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14791","created_at":"2026-07-05T09:39:11Z"},{"alias_kind":"pith_short_12","alias_value":"N6HHZUEFZMCU","created_at":"2026-07-05T09:39:11Z"},{"alias_kind":"pith_short_16","alias_value":"N6HHZUEFZMCURFUE","created_at":"2026-07-05T09:39:11Z"},{"alias_kind":"pith_short_8","alias_value":"N6HHZUEF","created_at":"2026-07-05T09:39:11Z"}],"graph_snapshots":[{"event_id":"sha256:c44946009c86b9e8c266b9fa6bf50502b4c81822c99de95e33b4ab90ef355750","target":"graph","created_at":"2026-07-05T09:39:11Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.14791/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the zero sets of the independence polynomial on recursive sequences of graphs. We prove that for a maximally independent starting graph and a stable and expanding recursion algorithm, the zeros of the independence polynomial are uniformly bounded. Each of the recursion algorithms leads to a rational dynamical system whose formula, degree and the dimension of the space it acts upon depend on the specific algorithm. Nevertheless, we demonstrate that the qualitative behavior of the dynamics exhibit universal features that can be exploited to draw conclusions about the zero sets.","authors_text":"Han Peters, Mikhail Hlushchanka","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.DS","submitted_at":"2024-11-22T08:22:40Z","title":"The independence polynomial on recursive sequences of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14791","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:22789dfb24be001ddd0d422aec69894551591683e25c7cde593d425f38007ad2","target":"record","created_at":"2026-07-05T09:39:11Z","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":"488248aebec12db7e8ac2d1ab9dd2aa6e9e3ed50a2fc9dcfb206049f0579901e","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.DS","submitted_at":"2024-11-22T08:22:40Z","title_canon_sha256":"3292dfd970773077c9182eddc91295ff86d835248f8c6d93129bfb0ae2d1fff7"},"schema_version":"1.0","source":{"id":"2411.14791","kind":"arxiv","version":1}},"canonical_sha256":"6f8e7cd085cb05489684219f577c967e7d952c889147570b9c3648f4f78717c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f8e7cd085cb05489684219f577c967e7d952c889147570b9c3648f4f78717c0","first_computed_at":"2026-07-05T09:39:11.934009Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:39:11.934009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yv32xn12/SqWs7GF+Cimw91hIAEwXF6z9F6AsMv72mU08Kkvt88RMcnFV0LekQ+wbxmSpFo2Jh7yKQ8V4hmEDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:39:11.934413Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.14791","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:22789dfb24be001ddd0d422aec69894551591683e25c7cde593d425f38007ad2","sha256:c44946009c86b9e8c266b9fa6bf50502b4c81822c99de95e33b4ab90ef355750"],"state_sha256":"2f2d6b44090943fa85d5b7b4b8d2895fc9a5eb44a7f159b6b6848ba93efbd4cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TWL2bBkTFyZiJ/YTGyhaT0eoGEZHccJ9Jt5PIHoMZdYCVQRIywf6tAvH5UWMAyqMOzgQcL46JnI74RL1F/KKAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T16:24:55.150013Z","bundle_sha256":"1a741f861681f74c6cbdbd2f76e4b2c16644e7d3cedc939228cdd7b7df367d15"}}