{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:G54OD2JZVGNG5UHMZPVGDENM32","short_pith_number":"pith:G54OD2JZ","schema_version":"1.0","canonical_sha256":"3778e1e939a99a6ed0eccbea6191acde86f800d9a6510ef3b70068f39e1af71c","source":{"kind":"arxiv","id":"2505.20898","version":1},"attestation_state":"computed","paper":{"title":"Circles and line segments as independence attractors of graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.CO","authors_text":"Garima Khetawat, Moumita Manna, Tarakanta Nayak","submitted_at":"2025-05-27T08:41:27Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2505.20898","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-27T08:41:27Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"d43a81a525f30cc7eac6001c307bcaa3b45a6bf9b15e4b4eb893553b072abf54","abstract_canon_sha256":"f1b5e6c48bdc0f196c406cbe9644ccdc6bf8cedf0bf5734fdd3de2a069f79d04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:10:20.642325Z","signature_b64":"ITzQpw60aKYLp69Ij246Lb8EyDKlhTCwFOhS6PVzjkpnw/0DAQZijEYyCufIcDxsMIzc+tzMP7aFez9nhGWVBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3778e1e939a99a6ed0eccbea6191acde86f800d9a6510ef3b70068f39e1af71c","last_reissued_at":"2026-07-05T11:10:20.641783Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:10:20.641783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Circles and line segments as independence attractors of graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.CO","authors_text":"Garima Khetawat, Moumita Manna, Tarakanta Nayak","submitted_at":"2025-05-27T08:41:27Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.20898","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/2505.20898/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2505.20898","created_at":"2026-07-05T11:10:20.641839+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.20898v1","created_at":"2026-07-05T11:10:20.641839+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.20898","created_at":"2026-07-05T11:10:20.641839+00:00"},{"alias_kind":"pith_short_12","alias_value":"G54OD2JZVGNG","created_at":"2026-07-05T11:10:20.641839+00:00"},{"alias_kind":"pith_short_16","alias_value":"G54OD2JZVGNG5UHM","created_at":"2026-07-05T11:10:20.641839+00:00"},{"alias_kind":"pith_short_8","alias_value":"G54OD2JZ","created_at":"2026-07-05T11:10:20.641839+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G54OD2JZVGNG5UHMZPVGDENM32","json":"https://pith.science/pith/G54OD2JZVGNG5UHMZPVGDENM32.json","graph_json":"https://pith.science/api/pith-number/G54OD2JZVGNG5UHMZPVGDENM32/graph.json","events_json":"https://pith.science/api/pith-number/G54OD2JZVGNG5UHMZPVGDENM32/events.json","paper":"https://pith.science/paper/G54OD2JZ"},"agent_actions":{"view_html":"https://pith.science/pith/G54OD2JZVGNG5UHMZPVGDENM32","download_json":"https://pith.science/pith/G54OD2JZVGNG5UHMZPVGDENM32.json","view_paper":"https://pith.science/paper/G54OD2JZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.20898&json=true","fetch_graph":"https://pith.science/api/pith-number/G54OD2JZVGNG5UHMZPVGDENM32/graph.json","fetch_events":"https://pith.science/api/pith-number/G54OD2JZVGNG5UHMZPVGDENM32/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G54OD2JZVGNG5UHMZPVGDENM32/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G54OD2JZVGNG5UHMZPVGDENM32/action/storage_attestation","attest_author":"https://pith.science/pith/G54OD2JZVGNG5UHMZPVGDENM32/action/author_attestation","sign_citation":"https://pith.science/pith/G54OD2JZVGNG5UHMZPVGDENM32/action/citation_signature","submit_replication":"https://pith.science/pith/G54OD2JZVGNG5UHMZPVGDENM32/action/replication_record"}},"created_at":"2026-07-05T11:10:20.641839+00:00","updated_at":"2026-07-05T11:10:20.641839+00:00"}