{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HAUHP4LBWXFCPDVDEU3BFDSMZF","short_pith_number":"pith:HAUHP4LB","canonical_record":{"source":{"id":"1309.0978","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-04T11:10:27Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"12eb0592ec587de72192944c4ab6d415d3a672274e7c72f1bba91486a6425208","abstract_canon_sha256":"e21880ddb089d4eea74651b362620293a5f7fb6ecc1603e98d91004c1b51f12a"},"schema_version":"1.0"},"canonical_sha256":"382877f161b5ca278ea32536128e4cc942814443945b36a4288d71264bb6172d","source":{"kind":"arxiv","id":"1309.0978","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0978","created_at":"2026-05-18T03:14:09Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0978v1","created_at":"2026-05-18T03:14:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0978","created_at":"2026-05-18T03:14:09Z"},{"alias_kind":"pith_short_12","alias_value":"HAUHP4LBWXFC","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HAUHP4LBWXFCPDVD","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HAUHP4LB","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HAUHP4LBWXFCPDVDEU3BFDSMZF","target":"record","payload":{"canonical_record":{"source":{"id":"1309.0978","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-04T11:10:27Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"12eb0592ec587de72192944c4ab6d415d3a672274e7c72f1bba91486a6425208","abstract_canon_sha256":"e21880ddb089d4eea74651b362620293a5f7fb6ecc1603e98d91004c1b51f12a"},"schema_version":"1.0"},"canonical_sha256":"382877f161b5ca278ea32536128e4cc942814443945b36a4288d71264bb6172d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:09.441333Z","signature_b64":"cpfvzLqAcR8C7Kfxh/5PNQdLZ56bUPIuJuq0tVsIoCA0p147dXf9Dsw/Ghe7rYJBueoZFQ0JRQYfi7v6ILM7Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"382877f161b5ca278ea32536128e4cc942814443945b36a4288d71264bb6172d","last_reissued_at":"2026-05-18T03:14:09.440715Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:09.440715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.0978","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-18T03:14:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iFWwbtlyBxwPDKeD30cTv/+cUGxImUcuVvhZRjz2E5U2Svb+HIYujC1w/t1h+OV7mc0HaRu7PRZjv/y/pO/qCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T09:21:45.763611Z"},"content_sha256":"058eb3808dcab8d36aec9a83308fbb53c25e651a93771629bc5e6788c877b3a9","schema_version":"1.0","event_id":"sha256:058eb3808dcab8d36aec9a83308fbb53c25e651a93771629bc5e6788c877b3a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HAUHP4LBWXFCPDVDEU3BFDSMZF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The four-in-a-tree problem in triangle-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Christophe Picouleau, Nicolas Derhy, Nicolas Trotignon","submitted_at":"2013-09-04T11:10:27Z","abstract_excerpt":"The three-in-a-tree algorithm of Chudnovsky and Seymour decides in time $O(n^4)$ whether three given vertices of a graph belong to an induced tree. Here, we study four-in-a-tree for triangle-free graphs. We give a structural answer to the following question: what does a triangle-free graph look like if no induced tree covers four given vertices? Our main result says that any such graph must have the \"same structure\", in a sense to be defined precisely, as a square or a cube.\n  We provide an $O(nm)$-time algorithm that given a triangle-free graph $G$ together with four vertices outputs either a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0978","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-18T03:14:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pYrglFpsyPRLZ/rYNinoSIMtCKEEbfR9Gn9pidtzz+aIr2VdMkMP9uEy3N457iblcOS7T0+SqkfvtPVnbfBcBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T09:21:45.763966Z"},"content_sha256":"21d4b9432fe4e142dbdedaf6d34a455f972cefca85f5233e7cb8fe159e6c1654","schema_version":"1.0","event_id":"sha256:21d4b9432fe4e142dbdedaf6d34a455f972cefca85f5233e7cb8fe159e6c1654"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HAUHP4LBWXFCPDVDEU3BFDSMZF/bundle.json","state_url":"https://pith.science/pith/HAUHP4LBWXFCPDVDEU3BFDSMZF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HAUHP4LBWXFCPDVDEU3BFDSMZF/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-06-25T09:21:45Z","links":{"resolver":"https://pith.science/pith/HAUHP4LBWXFCPDVDEU3BFDSMZF","bundle":"https://pith.science/pith/HAUHP4LBWXFCPDVDEU3BFDSMZF/bundle.json","state":"https://pith.science/pith/HAUHP4LBWXFCPDVDEU3BFDSMZF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HAUHP4LBWXFCPDVDEU3BFDSMZF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HAUHP4LBWXFCPDVDEU3BFDSMZF","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":"e21880ddb089d4eea74651b362620293a5f7fb6ecc1603e98d91004c1b51f12a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-04T11:10:27Z","title_canon_sha256":"12eb0592ec587de72192944c4ab6d415d3a672274e7c72f1bba91486a6425208"},"schema_version":"1.0","source":{"id":"1309.0978","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0978","created_at":"2026-05-18T03:14:09Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0978v1","created_at":"2026-05-18T03:14:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0978","created_at":"2026-05-18T03:14:09Z"},{"alias_kind":"pith_short_12","alias_value":"HAUHP4LBWXFC","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HAUHP4LBWXFCPDVD","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HAUHP4LB","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:21d4b9432fe4e142dbdedaf6d34a455f972cefca85f5233e7cb8fe159e6c1654","target":"graph","created_at":"2026-05-18T03:14:09Z","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":"The three-in-a-tree algorithm of Chudnovsky and Seymour decides in time $O(n^4)$ whether three given vertices of a graph belong to an induced tree. Here, we study four-in-a-tree for triangle-free graphs. We give a structural answer to the following question: what does a triangle-free graph look like if no induced tree covers four given vertices? Our main result says that any such graph must have the \"same structure\", in a sense to be defined precisely, as a square or a cube.\n  We provide an $O(nm)$-time algorithm that given a triangle-free graph $G$ together with four vertices outputs either a","authors_text":"Christophe Picouleau, Nicolas Derhy, Nicolas Trotignon","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-04T11:10:27Z","title":"The four-in-a-tree problem in triangle-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0978","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:058eb3808dcab8d36aec9a83308fbb53c25e651a93771629bc5e6788c877b3a9","target":"record","created_at":"2026-05-18T03:14:09Z","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":"e21880ddb089d4eea74651b362620293a5f7fb6ecc1603e98d91004c1b51f12a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-04T11:10:27Z","title_canon_sha256":"12eb0592ec587de72192944c4ab6d415d3a672274e7c72f1bba91486a6425208"},"schema_version":"1.0","source":{"id":"1309.0978","kind":"arxiv","version":1}},"canonical_sha256":"382877f161b5ca278ea32536128e4cc942814443945b36a4288d71264bb6172d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"382877f161b5ca278ea32536128e4cc942814443945b36a4288d71264bb6172d","first_computed_at":"2026-05-18T03:14:09.440715Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:14:09.440715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cpfvzLqAcR8C7Kfxh/5PNQdLZ56bUPIuJuq0tVsIoCA0p147dXf9Dsw/Ghe7rYJBueoZFQ0JRQYfi7v6ILM7Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:14:09.441333Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.0978","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:058eb3808dcab8d36aec9a83308fbb53c25e651a93771629bc5e6788c877b3a9","sha256:21d4b9432fe4e142dbdedaf6d34a455f972cefca85f5233e7cb8fe159e6c1654"],"state_sha256":"adefdbf933b015a54257c552fe9922c5c42a6d19b9ec9a59d374c2b669762b95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"skPLnikE4YDgdHSO9VrQBpy5stGe+xLUnHgMnFBfbCMj7sb8Ma1p801MdpmDylrJnCA9S1KRhQBacxuY8fmVAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T09:21:45.765959Z","bundle_sha256":"4592d86661d4dcc82b5ae29255b0d88832f75dcb09eb1e20c8b6319d3222d379"}}