{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:G54OD2JZVGNG5UHMZPVGDENM32","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":"f1b5e6c48bdc0f196c406cbe9644ccdc6bf8cedf0bf5734fdd3de2a069f79d04","cross_cats_sorted":["math.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-27T08:41:27Z","title_canon_sha256":"d43a81a525f30cc7eac6001c307bcaa3b45a6bf9b15e4b4eb893553b072abf54"},"schema_version":"1.0","source":{"id":"2505.20898","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.20898","created_at":"2026-07-05T11:10:20Z"},{"alias_kind":"arxiv_version","alias_value":"2505.20898v1","created_at":"2026-07-05T11:10:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.20898","created_at":"2026-07-05T11:10:20Z"},{"alias_kind":"pith_short_12","alias_value":"G54OD2JZVGNG","created_at":"2026-07-05T11:10:20Z"},{"alias_kind":"pith_short_16","alias_value":"G54OD2JZVGNG5UHM","created_at":"2026-07-05T11:10:20Z"},{"alias_kind":"pith_short_8","alias_value":"G54OD2JZ","created_at":"2026-07-05T11:10:20Z"}],"graph_snapshots":[{"event_id":"sha256:e3b35dd366a456060835be1c4c31cf6391d4c7c872cf389497ea847f3fe713df","target":"graph","created_at":"2026-07-05T11:10:20Z","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/2505.20898/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"By an independent set in a simple graph $G$, we mean a set of pairwise non-adjacent vertices in $G$. The independence polynomial of $G$ is defined as $I_G(z)=a_0 + a_1 z + a_2 z^2+\\cdots+a_\\alpha z^{\\alpha}$, where $a_i$ is the number of independent sets in $G$ with cardinality $i$ and $\\alpha$ is the cardinality of a largest independent set in $G$, known as the independence number of $G$. Let $G^m$ denote the $m$-times lexicographic product of $G$ with itself. The independence attractor of $G$, denoted by $\\mathcal{A}(G)$, is defined as $\\mathcal{A}(G) = \\lim_{m\\rightarrow \\infty} \\{z: I_{G^m","authors_text":"Garima Khetawat, Moumita Manna, Tarakanta Nayak","cross_cats":["math.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-27T08:41:27Z","title":"Circles and line segments as independence attractors of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.20898","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:01b3d528f2e01bbb6cf355cfb087e415f6725c775dcfcf771d61d1ff93e15ecc","target":"record","created_at":"2026-07-05T11:10:20Z","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":"f1b5e6c48bdc0f196c406cbe9644ccdc6bf8cedf0bf5734fdd3de2a069f79d04","cross_cats_sorted":["math.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-27T08:41:27Z","title_canon_sha256":"d43a81a525f30cc7eac6001c307bcaa3b45a6bf9b15e4b4eb893553b072abf54"},"schema_version":"1.0","source":{"id":"2505.20898","kind":"arxiv","version":1}},"canonical_sha256":"3778e1e939a99a6ed0eccbea6191acde86f800d9a6510ef3b70068f39e1af71c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3778e1e939a99a6ed0eccbea6191acde86f800d9a6510ef3b70068f39e1af71c","first_computed_at":"2026-07-05T11:10:20.641783Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:10:20.641783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ITzQpw60aKYLp69Ij246Lb8EyDKlhTCwFOhS6PVzjkpnw/0DAQZijEYyCufIcDxsMIzc+tzMP7aFez9nhGWVBw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:10:20.642325Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.20898","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:01b3d528f2e01bbb6cf355cfb087e415f6725c775dcfcf771d61d1ff93e15ecc","sha256:e3b35dd366a456060835be1c4c31cf6391d4c7c872cf389497ea847f3fe713df"],"state_sha256":"7afdae7bd85b20ad45e578b7bea0ce4c628666454d0e5797cb56a68221b9bae7"}