{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:XGDOK2BBOWYEAHMRINWPWBPUWR","short_pith_number":"pith:XGDOK2BB","canonical_record":{"source":{"id":"1408.1265","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-06T12:51:02Z","cross_cats_sorted":[],"title_canon_sha256":"a0d450570488f01d74253774bd7243a0e7508b400269f46bc70c6d35dbf42b32","abstract_canon_sha256":"ced0f483bef494b2f8d8162a611808ebb51046937e979836b7244147f66ea971"},"schema_version":"1.0"},"canonical_sha256":"b986e5682175b0401d91436cfb05f4b441e0162895a3451bf08b2d9c6a971b92","source":{"kind":"arxiv","id":"1408.1265","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1265","created_at":"2026-05-18T02:45:47Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1265v1","created_at":"2026-05-18T02:45:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1265","created_at":"2026-05-18T02:45:47Z"},{"alias_kind":"pith_short_12","alias_value":"XGDOK2BBOWYE","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XGDOK2BBOWYEAHMR","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XGDOK2BB","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:XGDOK2BBOWYEAHMRINWPWBPUWR","target":"record","payload":{"canonical_record":{"source":{"id":"1408.1265","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-06T12:51:02Z","cross_cats_sorted":[],"title_canon_sha256":"a0d450570488f01d74253774bd7243a0e7508b400269f46bc70c6d35dbf42b32","abstract_canon_sha256":"ced0f483bef494b2f8d8162a611808ebb51046937e979836b7244147f66ea971"},"schema_version":"1.0"},"canonical_sha256":"b986e5682175b0401d91436cfb05f4b441e0162895a3451bf08b2d9c6a971b92","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:47.771051Z","signature_b64":"hUmV8gBs72+bVVePWvRXmL3sW9+9D7V2+ZLxUJR2R4GIY7x43PkBSmn7Ex6KwKz+Tb+0idMTXzwNYNRsZV48Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b986e5682175b0401d91436cfb05f4b441e0162895a3451bf08b2d9c6a971b92","last_reissued_at":"2026-05-18T02:45:47.770382Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:47.770382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.1265","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-05-18T02:45:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"POUFR4dw2ABCohcZHe+DTMvtUpDCgC7myhMJNoKujz7wfJYvc/NEhqJrBsE5ZO9N/ii4/Z/kQHDnnPBlpZDiDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T16:28:55.312808Z"},"content_sha256":"b8137a9f87d9d773a5e9a93c6ff137da3e3704d8b22034fc88f60f7d11896858","schema_version":"1.0","event_id":"sha256:b8137a9f87d9d773a5e9a93c6ff137da3e3704d8b22034fc88f60f7d11896858"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:XGDOK2BBOWYEAHMRINWPWBPUWR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Amortized $\\tilde{O}(|V|)$-Delay Algorithm for Listing Chordless Cycles in Undirected Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gustavo Sacomoto, Marie-France Sagot, Roberto Grossi, Romeo Rizzi, Rui Ferreira","submitted_at":"2014-08-06T12:51:02Z","abstract_excerpt":"Chordless cycles are very natural structures in undirected graphs, with an important history and distinguished role in graph theory. Motivated also by previous work on the classical problem of listing cycles, we study how to list chordless cycles. The best known solution to list all the $C$ chordless cycles contained in an undirected graph $G = (V,E)$ takes $O(|E|^2 +|E|\\cdot C)$ time. In this paper we provide an algorithm taking $\\tilde{O}(|E| + |V |\\cdot C)$ time. We also show how to obtain the same complexity for listing all the $P$ chordless $st$-paths in $G$ (where $C$ is replaced by $P$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1265","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"},"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-05-18T02:45:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rBBVOMuIRTASE/q3AEXqJJIh+cyt92pD+HBdeepZfVu8JeDFZwvSq/vvtgea+LqrOlhaXK/Y4G19Jq9as3KBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T16:28:55.313157Z"},"content_sha256":"7d6f52034e005e319dd70f8ce7822011c08bf583e3911ba21d1ca36bce6b9e0f","schema_version":"1.0","event_id":"sha256:7d6f52034e005e319dd70f8ce7822011c08bf583e3911ba21d1ca36bce6b9e0f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XGDOK2BBOWYEAHMRINWPWBPUWR/bundle.json","state_url":"https://pith.science/pith/XGDOK2BBOWYEAHMRINWPWBPUWR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XGDOK2BBOWYEAHMRINWPWBPUWR/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-05-24T16:28:55Z","links":{"resolver":"https://pith.science/pith/XGDOK2BBOWYEAHMRINWPWBPUWR","bundle":"https://pith.science/pith/XGDOK2BBOWYEAHMRINWPWBPUWR/bundle.json","state":"https://pith.science/pith/XGDOK2BBOWYEAHMRINWPWBPUWR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XGDOK2BBOWYEAHMRINWPWBPUWR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XGDOK2BBOWYEAHMRINWPWBPUWR","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":"ced0f483bef494b2f8d8162a611808ebb51046937e979836b7244147f66ea971","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-06T12:51:02Z","title_canon_sha256":"a0d450570488f01d74253774bd7243a0e7508b400269f46bc70c6d35dbf42b32"},"schema_version":"1.0","source":{"id":"1408.1265","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1265","created_at":"2026-05-18T02:45:47Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1265v1","created_at":"2026-05-18T02:45:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1265","created_at":"2026-05-18T02:45:47Z"},{"alias_kind":"pith_short_12","alias_value":"XGDOK2BBOWYE","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XGDOK2BBOWYEAHMR","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XGDOK2BB","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:7d6f52034e005e319dd70f8ce7822011c08bf583e3911ba21d1ca36bce6b9e0f","target":"graph","created_at":"2026-05-18T02:45:47Z","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"},"paper":{"abstract_excerpt":"Chordless cycles are very natural structures in undirected graphs, with an important history and distinguished role in graph theory. Motivated also by previous work on the classical problem of listing cycles, we study how to list chordless cycles. The best known solution to list all the $C$ chordless cycles contained in an undirected graph $G = (V,E)$ takes $O(|E|^2 +|E|\\cdot C)$ time. In this paper we provide an algorithm taking $\\tilde{O}(|E| + |V |\\cdot C)$ time. We also show how to obtain the same complexity for listing all the $P$ chordless $st$-paths in $G$ (where $C$ is replaced by $P$ ","authors_text":"Gustavo Sacomoto, Marie-France Sagot, Roberto Grossi, Romeo Rizzi, Rui Ferreira","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-06T12:51:02Z","title":"Amortized $\\tilde{O}(|V|)$-Delay Algorithm for Listing Chordless Cycles in Undirected Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1265","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:b8137a9f87d9d773a5e9a93c6ff137da3e3704d8b22034fc88f60f7d11896858","target":"record","created_at":"2026-05-18T02:45:47Z","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":"ced0f483bef494b2f8d8162a611808ebb51046937e979836b7244147f66ea971","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-06T12:51:02Z","title_canon_sha256":"a0d450570488f01d74253774bd7243a0e7508b400269f46bc70c6d35dbf42b32"},"schema_version":"1.0","source":{"id":"1408.1265","kind":"arxiv","version":1}},"canonical_sha256":"b986e5682175b0401d91436cfb05f4b441e0162895a3451bf08b2d9c6a971b92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b986e5682175b0401d91436cfb05f4b441e0162895a3451bf08b2d9c6a971b92","first_computed_at":"2026-05-18T02:45:47.770382Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:47.770382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hUmV8gBs72+bVVePWvRXmL3sW9+9D7V2+ZLxUJR2R4GIY7x43PkBSmn7Ex6KwKz+Tb+0idMTXzwNYNRsZV48Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:47.771051Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.1265","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b8137a9f87d9d773a5e9a93c6ff137da3e3704d8b22034fc88f60f7d11896858","sha256:7d6f52034e005e319dd70f8ce7822011c08bf583e3911ba21d1ca36bce6b9e0f"],"state_sha256":"a040581c7b253b882ae3e63835c28a5b7db42b1dec2b858326dd2289f2865278"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZfAruOxIdu0lwFIrklXKal5QWhLRE5O1QGF5NYTzCllgmDds43dTx////7EKDnKNWnYzop2NWiFv3sMfwINMCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T16:28:55.315608Z","bundle_sha256":"f58a434744449bacd6e2cacadc263a58ba1a15bc3bc2269584c16340d99344d7"}}