{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:YCECPLR5LQKXLLZ4DXBNJH53A5","short_pith_number":"pith:YCECPLR5","schema_version":"1.0","canonical_sha256":"c08827ae3d5c1575af3c1dc2d49fbb0777de4612df5abbb308bc812791282f67","source":{"kind":"arxiv","id":"1906.06611","version":1},"attestation_state":"computed","paper":{"title":"A parametrized Poincare-Hopf Theorem and Clique Cardinalities of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Oliver Knill","submitted_at":"2019-06-15T20:56:11Z","abstract_excerpt":"Given a locally injective real function g on the vertex set V of a finite simple graph G=(V,E), we prove the Poincare-Hopf formula f_G(t) = 1+t sum_{x in V} f_{S_g(x)}(t), where S_g(x) = { y in S(x), g(y) less than g(x) } and f_G(t)=1+f_0 t + ... + f_{d} t^{d+1} is the f-function encoding the f-vector of a graph G, where f_k counts the number of k-dimensional cliques, complete sub-graphs, in G. The corresponding computation of f reduces the problem recursively to n tasks of graphs of half the size. For t=-1, the parametric Poincare-Hopf formula reduces to the classical Poincare-Hopf result X(G"},"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":"1906.06611","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-15T20:56:11Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"50bf7de442af3aeef3814652a567b81425b83f0798c05507778c17ebb0891d6e","abstract_canon_sha256":"c13ca9a385acbb4ca743727e2f0a82ede71c231fe8267febfae4c9c9503ab991"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:13.196524Z","signature_b64":"OIjWeCLPDA2EWGVxOnSiSopqwrHB9z1qCQT0CJ1EHIFZHumDaK/XDTbK5UF3mRSJqgCYOJCzRWKthU/7YsbZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c08827ae3d5c1575af3c1dc2d49fbb0777de4612df5abbb308bc812791282f67","last_reissued_at":"2026-05-17T23:43:13.195964Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:13.195964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A parametrized Poincare-Hopf Theorem and Clique Cardinalities of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Oliver Knill","submitted_at":"2019-06-15T20:56:11Z","abstract_excerpt":"Given a locally injective real function g on the vertex set V of a finite simple graph G=(V,E), we prove the Poincare-Hopf formula f_G(t) = 1+t sum_{x in V} f_{S_g(x)}(t), where S_g(x) = { y in S(x), g(y) less than g(x) } and f_G(t)=1+f_0 t + ... + f_{d} t^{d+1} is the f-function encoding the f-vector of a graph G, where f_k counts the number of k-dimensional cliques, complete sub-graphs, in G. The corresponding computation of f reduces the problem recursively to n tasks of graphs of half the size. For t=-1, the parametric Poincare-Hopf formula reduces to the classical Poincare-Hopf result X(G"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.06611","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.06611","created_at":"2026-05-17T23:43:13.196049+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.06611v1","created_at":"2026-05-17T23:43:13.196049+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.06611","created_at":"2026-05-17T23:43:13.196049+00:00"},{"alias_kind":"pith_short_12","alias_value":"YCECPLR5LQKX","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"YCECPLR5LQKXLLZ4","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"YCECPLR5","created_at":"2026-05-18T12:33:33.725879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1907.03369","citing_title":"The energy of a simplicial complex","ref_index":38,"is_internal_anchor":true},{"citing_arxiv_id":"1907.09092","citing_title":"The counting matrix of a simplicial complex","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YCECPLR5LQKXLLZ4DXBNJH53A5","json":"https://pith.science/pith/YCECPLR5LQKXLLZ4DXBNJH53A5.json","graph_json":"https://pith.science/api/pith-number/YCECPLR5LQKXLLZ4DXBNJH53A5/graph.json","events_json":"https://pith.science/api/pith-number/YCECPLR5LQKXLLZ4DXBNJH53A5/events.json","paper":"https://pith.science/paper/YCECPLR5"},"agent_actions":{"view_html":"https://pith.science/pith/YCECPLR5LQKXLLZ4DXBNJH53A5","download_json":"https://pith.science/pith/YCECPLR5LQKXLLZ4DXBNJH53A5.json","view_paper":"https://pith.science/paper/YCECPLR5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.06611&json=true","fetch_graph":"https://pith.science/api/pith-number/YCECPLR5LQKXLLZ4DXBNJH53A5/graph.json","fetch_events":"https://pith.science/api/pith-number/YCECPLR5LQKXLLZ4DXBNJH53A5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YCECPLR5LQKXLLZ4DXBNJH53A5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YCECPLR5LQKXLLZ4DXBNJH53A5/action/storage_attestation","attest_author":"https://pith.science/pith/YCECPLR5LQKXLLZ4DXBNJH53A5/action/author_attestation","sign_citation":"https://pith.science/pith/YCECPLR5LQKXLLZ4DXBNJH53A5/action/citation_signature","submit_replication":"https://pith.science/pith/YCECPLR5LQKXLLZ4DXBNJH53A5/action/replication_record"}},"created_at":"2026-05-17T23:43:13.196049+00:00","updated_at":"2026-05-17T23:43:13.196049+00:00"}