{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ZOWXNP42T45FMBUHBAU55AFFKI","short_pith_number":"pith:ZOWXNP42","schema_version":"1.0","canonical_sha256":"cbad76bf9a9f3a5606870829de80a5523c94fd1330ba77b23210fb49fe5acac8","source":{"kind":"arxiv","id":"1309.0694","version":1},"attestation_state":"computed","paper":{"title":"Algorithms for square-$3PC(\\cdot, \\cdot)$-free Berge graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Fr\\'ed\\'eric Maffray, Kristina Vu\\v{s}kovi\\'c, Nicolas Trotignon","submitted_at":"2013-09-03T14:22:42Z","abstract_excerpt":"We consider the class of graphs containing no odd hole, no odd antihole, and no configuration consisting of three paths between two nodes such that any two of the paths induce a hole, and at least two of the paths are of length 2. This class generalizes claw-free Berge graphs and square-free Berge graphs. We give a combinatorial algorithm of complexity $O(n^{7})$ to find a clique of maximum weight in such a graph. We also consider several subgraph-detection problems related to this class."},"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":"1309.0694","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-03T14:22:42Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"c164ef84217d5d959a3c77dce6a3adc82a141036f367189b817961bb5b1da9b1","abstract_canon_sha256":"d49f53e2594fda3a9ec2ee54f70f0d6417f1da79e3cc4ef6b6632c0c48ce1a87"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:19.657443Z","signature_b64":"Jtu0CXtKNPuHq9i9r4d7lXIxylcrA0MgBsEt/LPMe7Hx0JB8OpR48cwiy4lRk1WivsTnzObvVlRcdMX1eAWRDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbad76bf9a9f3a5606870829de80a5523c94fd1330ba77b23210fb49fe5acac8","last_reissued_at":"2026-05-18T01:18:19.656860Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:19.656860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for square-$3PC(\\cdot, \\cdot)$-free Berge graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Fr\\'ed\\'eric Maffray, Kristina Vu\\v{s}kovi\\'c, Nicolas Trotignon","submitted_at":"2013-09-03T14:22:42Z","abstract_excerpt":"We consider the class of graphs containing no odd hole, no odd antihole, and no configuration consisting of three paths between two nodes such that any two of the paths induce a hole, and at least two of the paths are of length 2. This class generalizes claw-free Berge graphs and square-free Berge graphs. We give a combinatorial algorithm of complexity $O(n^{7})$ to find a clique of maximum weight in such a graph. We also consider several subgraph-detection problems related to this class."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0694","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":"1309.0694","created_at":"2026-05-18T01:18:19.656947+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.0694v1","created_at":"2026-05-18T01:18:19.656947+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0694","created_at":"2026-05-18T01:18:19.656947+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZOWXNP42T45F","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZOWXNP42T45FMBUH","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZOWXNP42","created_at":"2026-05-18T12:28:09.283467+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/ZOWXNP42T45FMBUHBAU55AFFKI","json":"https://pith.science/pith/ZOWXNP42T45FMBUHBAU55AFFKI.json","graph_json":"https://pith.science/api/pith-number/ZOWXNP42T45FMBUHBAU55AFFKI/graph.json","events_json":"https://pith.science/api/pith-number/ZOWXNP42T45FMBUHBAU55AFFKI/events.json","paper":"https://pith.science/paper/ZOWXNP42"},"agent_actions":{"view_html":"https://pith.science/pith/ZOWXNP42T45FMBUHBAU55AFFKI","download_json":"https://pith.science/pith/ZOWXNP42T45FMBUHBAU55AFFKI.json","view_paper":"https://pith.science/paper/ZOWXNP42","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.0694&json=true","fetch_graph":"https://pith.science/api/pith-number/ZOWXNP42T45FMBUHBAU55AFFKI/graph.json","fetch_events":"https://pith.science/api/pith-number/ZOWXNP42T45FMBUHBAU55AFFKI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZOWXNP42T45FMBUHBAU55AFFKI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZOWXNP42T45FMBUHBAU55AFFKI/action/storage_attestation","attest_author":"https://pith.science/pith/ZOWXNP42T45FMBUHBAU55AFFKI/action/author_attestation","sign_citation":"https://pith.science/pith/ZOWXNP42T45FMBUHBAU55AFFKI/action/citation_signature","submit_replication":"https://pith.science/pith/ZOWXNP42T45FMBUHBAU55AFFKI/action/replication_record"}},"created_at":"2026-05-18T01:18:19.656947+00:00","updated_at":"2026-05-18T01:18:19.656947+00:00"}