{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:HNKHQDV6XBA5FP5ZN6UZLMNINK","short_pith_number":"pith:HNKHQDV6","canonical_record":{"source":{"id":"2607.29322","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-31T11:53:38Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"19c28bf40ec72035cc5653f0fe4ce5bef6f281c890b9d25d6a7d0e05b5706aba","abstract_canon_sha256":"4a85cc18d9c42c8855733ac80e918377543c0a85b4fe27dfb223ced8a756e608"},"schema_version":"1.0"},"canonical_sha256":"3b54780ebeb841d2bfb96fa995b1a86aa19365339af5c650f8cd88f813493ebb","source":{"kind":"arxiv","id":"2607.29322","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.29322","created_at":"2026-08-03T01:24:53Z"},{"alias_kind":"arxiv_version","alias_value":"2607.29322v1","created_at":"2026-08-03T01:24:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.29322","created_at":"2026-08-03T01:24:53Z"},{"alias_kind":"pith_short_12","alias_value":"HNKHQDV6XBA5","created_at":"2026-08-03T01:24:53Z"},{"alias_kind":"pith_short_16","alias_value":"HNKHQDV6XBA5FP5Z","created_at":"2026-08-03T01:24:53Z"},{"alias_kind":"pith_short_8","alias_value":"HNKHQDV6","created_at":"2026-08-03T01:24:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:HNKHQDV6XBA5FP5ZN6UZLMNINK","target":"record","payload":{"canonical_record":{"source":{"id":"2607.29322","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-31T11:53:38Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"19c28bf40ec72035cc5653f0fe4ce5bef6f281c890b9d25d6a7d0e05b5706aba","abstract_canon_sha256":"4a85cc18d9c42c8855733ac80e918377543c0a85b4fe27dfb223ced8a756e608"},"schema_version":"1.0"},"canonical_sha256":"3b54780ebeb841d2bfb96fa995b1a86aa19365339af5c650f8cd88f813493ebb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-03T01:24:53.104088Z","signature_b64":"CsEYCNl1g2Z02GnJprOt8fVEM+9Aq6iSHRlGorFUmYI8rh9dkOk7Qcfectjw8JQ2GGcpnixe01Nyf14AVcnqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b54780ebeb841d2bfb96fa995b1a86aa19365339af5c650f8cd88f813493ebb","last_reissued_at":"2026-08-03T01:24:53.102654Z","signature_status":"signed_v1","first_computed_at":"2026-08-03T01:24:53.102654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.29322","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-08-03T01:24:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nwuZgNSUBXIx0Qs2dGErPymuMmbuxJgpxcuwmZM07bMzMp8efn8NbJtdvP+6SMfOYRRevyFuuHTFs9xRUyNxDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T00:01:18.717842Z"},"content_sha256":"561969eeacd970872e68a7c2c4ed218ea27bd921c1a558aebe9bd681e80beabd","schema_version":"1.0","event_id":"sha256:561969eeacd970872e68a7c2c4ed218ea27bd921c1a558aebe9bd681e80beabd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:HNKHQDV6XBA5FP5ZN6UZLMNINK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structural Classification of a Graph with Independence Number Five","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.CO","authors_text":"Dinesh Kumar, Manisha Kumari","submitted_at":"2026-07-31T11:53:38Z","abstract_excerpt":"The independence polynomial of a simple graph $G$ is given by \\( I_G(z) = i_0 + i_1 z + i_2 z^2 + \\cdots + i_\\alpha z^\\alpha \\), where \\( i_\\alpha \\) denotes the size of a maximum independent set, also called the independence number of the graph. The independence polynomial has the notable feature of being essentially closed under graph composition (lexicographic product). In this paper, we determine the independence polynomials of size five. For a disconnected graph $G$, we exploit the fact that $I_G(z)$ factors as the product of the independence polynomials of the connected components of $G$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.29322","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/2607.29322/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-08-03T01:24:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"buPmJ79MESo9ftJtG/0LJzgMBZtVV070kW3bR8dOnb5KzTfuWDvc7YsJfmGVV6H6MbiulFKUPL920r+uzXYDAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T00:01:18.718591Z"},"content_sha256":"b0a7db379113bbf782d418c29f01c07cfa26c43460db2fab9fb82f989c4c2f94","schema_version":"1.0","event_id":"sha256:b0a7db379113bbf782d418c29f01c07cfa26c43460db2fab9fb82f989c4c2f94"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HNKHQDV6XBA5FP5ZN6UZLMNINK/bundle.json","state_url":"https://pith.science/pith/HNKHQDV6XBA5FP5ZN6UZLMNINK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HNKHQDV6XBA5FP5ZN6UZLMNINK/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-10T00:01:18Z","links":{"resolver":"https://pith.science/pith/HNKHQDV6XBA5FP5ZN6UZLMNINK","bundle":"https://pith.science/pith/HNKHQDV6XBA5FP5ZN6UZLMNINK/bundle.json","state":"https://pith.science/pith/HNKHQDV6XBA5FP5ZN6UZLMNINK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HNKHQDV6XBA5FP5ZN6UZLMNINK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:HNKHQDV6XBA5FP5ZN6UZLMNINK","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":"4a85cc18d9c42c8855733ac80e918377543c0a85b4fe27dfb223ced8a756e608","cross_cats_sorted":["math.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-31T11:53:38Z","title_canon_sha256":"19c28bf40ec72035cc5653f0fe4ce5bef6f281c890b9d25d6a7d0e05b5706aba"},"schema_version":"1.0","source":{"id":"2607.29322","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.29322","created_at":"2026-08-03T01:24:53Z"},{"alias_kind":"arxiv_version","alias_value":"2607.29322v1","created_at":"2026-08-03T01:24:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.29322","created_at":"2026-08-03T01:24:53Z"},{"alias_kind":"pith_short_12","alias_value":"HNKHQDV6XBA5","created_at":"2026-08-03T01:24:53Z"},{"alias_kind":"pith_short_16","alias_value":"HNKHQDV6XBA5FP5Z","created_at":"2026-08-03T01:24:53Z"},{"alias_kind":"pith_short_8","alias_value":"HNKHQDV6","created_at":"2026-08-03T01:24:53Z"}],"graph_snapshots":[{"event_id":"sha256:b0a7db379113bbf782d418c29f01c07cfa26c43460db2fab9fb82f989c4c2f94","target":"graph","created_at":"2026-08-03T01:24:53Z","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/2607.29322/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The independence polynomial of a simple graph $G$ is given by \\( I_G(z) = i_0 + i_1 z + i_2 z^2 + \\cdots + i_\\alpha z^\\alpha \\), where \\( i_\\alpha \\) denotes the size of a maximum independent set, also called the independence number of the graph. The independence polynomial has the notable feature of being essentially closed under graph composition (lexicographic product). In this paper, we determine the independence polynomials of size five. For a disconnected graph $G$, we exploit the fact that $I_G(z)$ factors as the product of the independence polynomials of the connected components of $G$","authors_text":"Dinesh Kumar, Manisha Kumari","cross_cats":["math.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-31T11:53:38Z","title":"Structural Classification of a Graph with Independence Number Five"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.29322","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:561969eeacd970872e68a7c2c4ed218ea27bd921c1a558aebe9bd681e80beabd","target":"record","created_at":"2026-08-03T01:24:53Z","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":"4a85cc18d9c42c8855733ac80e918377543c0a85b4fe27dfb223ced8a756e608","cross_cats_sorted":["math.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-31T11:53:38Z","title_canon_sha256":"19c28bf40ec72035cc5653f0fe4ce5bef6f281c890b9d25d6a7d0e05b5706aba"},"schema_version":"1.0","source":{"id":"2607.29322","kind":"arxiv","version":1}},"canonical_sha256":"3b54780ebeb841d2bfb96fa995b1a86aa19365339af5c650f8cd88f813493ebb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b54780ebeb841d2bfb96fa995b1a86aa19365339af5c650f8cd88f813493ebb","first_computed_at":"2026-08-03T01:24:53.102654Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-03T01:24:53.102654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CsEYCNl1g2Z02GnJprOt8fVEM+9Aq6iSHRlGorFUmYI8rh9dkOk7Qcfectjw8JQ2GGcpnixe01Nyf14AVcnqCg==","signature_status":"signed_v1","signed_at":"2026-08-03T01:24:53.104088Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.29322","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:561969eeacd970872e68a7c2c4ed218ea27bd921c1a558aebe9bd681e80beabd","sha256:b0a7db379113bbf782d418c29f01c07cfa26c43460db2fab9fb82f989c4c2f94"],"state_sha256":"823ddaf4aea3120d6acbb39815b50c6cf8eebdddcf47b1e2d177a3a58e3842f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fqDWtux3cLsEI01o/9k2kr+gjOKRjnABlyySntkoctP9MiGr4NOi5huMVWlR+hpzxSQQFOi0pVjEoq9nnNa+Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T00:01:18.725088Z","bundle_sha256":"36f0ebb5c9c961abc4739b4f4219a12f9b984d124d2e3baec35417e1567006d6"}}