{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:E6LHK6I5GJ2DKKRNKLLJSCJWXX","short_pith_number":"pith:E6LHK6I5","schema_version":"1.0","canonical_sha256":"279675791d3274352a2d52d6990936bde81b59055a29cc9099ff464ee1c9fd2b","source":{"kind":"arxiv","id":"1707.09670","version":4},"attestation_state":"computed","paper":{"title":"Topological Graph Persistence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lorenzo Zuffi, Massimo Ferri, Mattia G. Bergomi","submitted_at":"2017-07-30T20:58:37Z","abstract_excerpt":"Graphs are a basic tool for the representation of modern data. The richness of the topological information contained in a graph goes far beyond its mere interpretation as a one-dimensional simplicial complex. We show how topological constructions can be used to gain information otherwise concealed by the low-dimensional nature of graphs. We do that by extending previous work of other researchers in homological persistence, by proposing novel graph-theoretical constructions. Beyond cliques, we use independent sets, neighborhoods, enclaveless sets and a Ramsey-inspired extended persistence."},"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":"1707.09670","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-30T20:58:37Z","cross_cats_sorted":[],"title_canon_sha256":"cce7b1f0fc362e788589290fd8ef2a366435add9ad9738e2632cd05f1e58133e","abstract_canon_sha256":"3cdc05311462839cd8dd1b4dab2a5fd4cf795084390db712aa32c4986d834c7f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:41.735648Z","signature_b64":"/5ZOtbiO5qyL7S0SnNtsTOdjyhj/4grLYERsOXb0/O2GagHLSiL0G1HAw6fAsfpHM/+9nbxBOTpc8g18i0/hDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"279675791d3274352a2d52d6990936bde81b59055a29cc9099ff464ee1c9fd2b","last_reissued_at":"2026-05-18T00:03:41.735157Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:41.735157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Topological Graph Persistence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lorenzo Zuffi, Massimo Ferri, Mattia G. Bergomi","submitted_at":"2017-07-30T20:58:37Z","abstract_excerpt":"Graphs are a basic tool for the representation of modern data. The richness of the topological information contained in a graph goes far beyond its mere interpretation as a one-dimensional simplicial complex. We show how topological constructions can be used to gain information otherwise concealed by the low-dimensional nature of graphs. We do that by extending previous work of other researchers in homological persistence, by proposing novel graph-theoretical constructions. Beyond cliques, we use independent sets, neighborhoods, enclaveless sets and a Ramsey-inspired extended persistence."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.09670","kind":"arxiv","version":4},"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":"1707.09670","created_at":"2026-05-18T00:03:41.735233+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.09670v4","created_at":"2026-05-18T00:03:41.735233+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.09670","created_at":"2026-05-18T00:03:41.735233+00:00"},{"alias_kind":"pith_short_12","alias_value":"E6LHK6I5GJ2D","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"E6LHK6I5GJ2DKKRN","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"E6LHK6I5","created_at":"2026-05-18T12:31:12.930513+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/E6LHK6I5GJ2DKKRNKLLJSCJWXX","json":"https://pith.science/pith/E6LHK6I5GJ2DKKRNKLLJSCJWXX.json","graph_json":"https://pith.science/api/pith-number/E6LHK6I5GJ2DKKRNKLLJSCJWXX/graph.json","events_json":"https://pith.science/api/pith-number/E6LHK6I5GJ2DKKRNKLLJSCJWXX/events.json","paper":"https://pith.science/paper/E6LHK6I5"},"agent_actions":{"view_html":"https://pith.science/pith/E6LHK6I5GJ2DKKRNKLLJSCJWXX","download_json":"https://pith.science/pith/E6LHK6I5GJ2DKKRNKLLJSCJWXX.json","view_paper":"https://pith.science/paper/E6LHK6I5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.09670&json=true","fetch_graph":"https://pith.science/api/pith-number/E6LHK6I5GJ2DKKRNKLLJSCJWXX/graph.json","fetch_events":"https://pith.science/api/pith-number/E6LHK6I5GJ2DKKRNKLLJSCJWXX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E6LHK6I5GJ2DKKRNKLLJSCJWXX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E6LHK6I5GJ2DKKRNKLLJSCJWXX/action/storage_attestation","attest_author":"https://pith.science/pith/E6LHK6I5GJ2DKKRNKLLJSCJWXX/action/author_attestation","sign_citation":"https://pith.science/pith/E6LHK6I5GJ2DKKRNKLLJSCJWXX/action/citation_signature","submit_replication":"https://pith.science/pith/E6LHK6I5GJ2DKKRNKLLJSCJWXX/action/replication_record"}},"created_at":"2026-05-18T00:03:41.735233+00:00","updated_at":"2026-05-18T00:03:41.735233+00:00"}