{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2TCAR3UD5G5K3O7R3B5YP7GIUC","short_pith_number":"pith:2TCAR3UD","schema_version":"1.0","canonical_sha256":"d4c408ee83e9baadbbf1d87b87fcc8a081283e96c2b3ae8e8ac62972f7b05138","source":{"kind":"arxiv","id":"1606.00289","version":2},"attestation_state":"computed","paper":{"title":"Enumerating simple paths from connected induced subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Paul Rochet (LMJL), Pierre-Louis Giscard","submitted_at":"2016-06-01T13:58:09Z","abstract_excerpt":"We present an exact formula for the ordinary generating series of the simple paths between any two vertices of a graph. Our formula involves the adjacency matrix of the connected induced subgraphs and remains valid on weighted and directed graphs. As a particular case, we obtain a relation linking the Hamiltonian paths and cycles of a graph to its dominating connected sets."},"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":"1606.00289","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-01T13:58:09Z","cross_cats_sorted":[],"title_canon_sha256":"eb4c0409297fe6322d21854a8deda7de77341cb58a6d64e0d7922d7e0384ca3c","abstract_canon_sha256":"741307445320ec3f249fe811c1d3530fd0921fc0274268ca89d6be491ca39796"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:13.842651Z","signature_b64":"2w5vNuNGmuLz1oYEnc51IX7/35a/j+g1HOlUI4tCm69NjcDCRdq6+KhlWx4DIReYrdhx/ecB2bPFAwzLn1ONDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4c408ee83e9baadbbf1d87b87fcc8a081283e96c2b3ae8e8ac62972f7b05138","last_reissued_at":"2026-05-18T00:02:13.842182Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:13.842182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enumerating simple paths from connected induced subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Paul Rochet (LMJL), Pierre-Louis Giscard","submitted_at":"2016-06-01T13:58:09Z","abstract_excerpt":"We present an exact formula for the ordinary generating series of the simple paths between any two vertices of a graph. Our formula involves the adjacency matrix of the connected induced subgraphs and remains valid on weighted and directed graphs. As a particular case, we obtain a relation linking the Hamiltonian paths and cycles of a graph to its dominating connected sets."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00289","kind":"arxiv","version":2},"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":"1606.00289","created_at":"2026-05-18T00:02:13.842271+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.00289v2","created_at":"2026-05-18T00:02:13.842271+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00289","created_at":"2026-05-18T00:02:13.842271+00:00"},{"alias_kind":"pith_short_12","alias_value":"2TCAR3UD5G5K","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"2TCAR3UD5G5K3O7R","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"2TCAR3UD","created_at":"2026-05-18T12:29:55.572404+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/2TCAR3UD5G5K3O7R3B5YP7GIUC","json":"https://pith.science/pith/2TCAR3UD5G5K3O7R3B5YP7GIUC.json","graph_json":"https://pith.science/api/pith-number/2TCAR3UD5G5K3O7R3B5YP7GIUC/graph.json","events_json":"https://pith.science/api/pith-number/2TCAR3UD5G5K3O7R3B5YP7GIUC/events.json","paper":"https://pith.science/paper/2TCAR3UD"},"agent_actions":{"view_html":"https://pith.science/pith/2TCAR3UD5G5K3O7R3B5YP7GIUC","download_json":"https://pith.science/pith/2TCAR3UD5G5K3O7R3B5YP7GIUC.json","view_paper":"https://pith.science/paper/2TCAR3UD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.00289&json=true","fetch_graph":"https://pith.science/api/pith-number/2TCAR3UD5G5K3O7R3B5YP7GIUC/graph.json","fetch_events":"https://pith.science/api/pith-number/2TCAR3UD5G5K3O7R3B5YP7GIUC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2TCAR3UD5G5K3O7R3B5YP7GIUC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2TCAR3UD5G5K3O7R3B5YP7GIUC/action/storage_attestation","attest_author":"https://pith.science/pith/2TCAR3UD5G5K3O7R3B5YP7GIUC/action/author_attestation","sign_citation":"https://pith.science/pith/2TCAR3UD5G5K3O7R3B5YP7GIUC/action/citation_signature","submit_replication":"https://pith.science/pith/2TCAR3UD5G5K3O7R3B5YP7GIUC/action/replication_record"}},"created_at":"2026-05-18T00:02:13.842271+00:00","updated_at":"2026-05-18T00:02:13.842271+00:00"}