{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AR3FTHCQCMX3DSLNT6CMXMATVG","short_pith_number":"pith:AR3FTHCQ","canonical_record":{"source":{"id":"1708.01777","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-05T15:16:47Z","cross_cats_sorted":[],"title_canon_sha256":"dd65497e285279c18120964b9cd9301f6806344dd5717efaec9a57ea1cbb8ccb","abstract_canon_sha256":"b938f86f4bf34b086745b2eaec6830d0f07216556d566d77fb7cb50facdd2699"},"schema_version":"1.0"},"canonical_sha256":"0476599c50132fb1c96d9f84cbb013a98d213267c232a4ea2d64dc9917e7582b","source":{"kind":"arxiv","id":"1708.01777","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01777","created_at":"2026-05-18T00:38:33Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01777v1","created_at":"2026-05-18T00:38:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01777","created_at":"2026-05-18T00:38:33Z"},{"alias_kind":"pith_short_12","alias_value":"AR3FTHCQCMX3","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AR3FTHCQCMX3DSLN","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AR3FTHCQ","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AR3FTHCQCMX3DSLNT6CMXMATVG","target":"record","payload":{"canonical_record":{"source":{"id":"1708.01777","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-05T15:16:47Z","cross_cats_sorted":[],"title_canon_sha256":"dd65497e285279c18120964b9cd9301f6806344dd5717efaec9a57ea1cbb8ccb","abstract_canon_sha256":"b938f86f4bf34b086745b2eaec6830d0f07216556d566d77fb7cb50facdd2699"},"schema_version":"1.0"},"canonical_sha256":"0476599c50132fb1c96d9f84cbb013a98d213267c232a4ea2d64dc9917e7582b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:33.194235Z","signature_b64":"LZEScJFMorfWvazb2U4iA+reqsJQnPCWFXZRyrWJn1A7mTzipVVTUh/STloK0qg1MoNSuB6qe17eWAg1CN65AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0476599c50132fb1c96d9f84cbb013a98d213267c232a4ea2d64dc9917e7582b","last_reissued_at":"2026-05-18T00:38:33.193743Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:33.193743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.01777","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-18T00:38:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FTqSRYcbtg6AU4ccwBzeoYnImu5mR8q1I7amaTGrfn+rh80JM+OPHMmHu9dUIyjIAV0JvAQSjuMkB7+C0k4VDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:04:43.916522Z"},"content_sha256":"013e06cb83d504911318932f8526188c12c81d164df5b62d7fadc67dafc56219","schema_version":"1.0","event_id":"sha256:013e06cb83d504911318932f8526188c12c81d164df5b62d7fadc67dafc56219"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AR3FTHCQCMX3DSLNT6CMXMATVG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding a subdivision of a prescribed digraph of order 4","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. Karolinna Maia, Bojan Mohar, Fr\\'ed\\'eric Havet","submitted_at":"2017-08-05T15:16:47Z","abstract_excerpt":"The problem of when a given digraph contains a subdivision of a fixed digraph $F$ is considered. Bang-Jensen et al. laid out foundations for approaching this problem from the algorithmic point of view. In this paper we give further support to several open conjectures and speculations about algorithmic complexity of finding $F$-subdivisions. In particular, up to 5 exceptions, we completely classify for which 4-vertex digraphs $F$, the $F$-subdivision problem is polynomial-time solvable and for which it is NP-complete. While all NP-hardness proofs are made by reduction from some version of the 2"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01777","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-18T00:38:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"veD7h+HtLru/N0n8lXK6A94WcfOcrFFV0AQFN+9nhlXk8PN8UYH6Wef/P6+0xVZ/KQgiksgdcAuRwi2Q1h/PCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:04:43.916863Z"},"content_sha256":"4b714d37fdf1e781e907d8bb12b994c801bf6d66ea85b74c10d105e0c9ad03d0","schema_version":"1.0","event_id":"sha256:4b714d37fdf1e781e907d8bb12b994c801bf6d66ea85b74c10d105e0c9ad03d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AR3FTHCQCMX3DSLNT6CMXMATVG/bundle.json","state_url":"https://pith.science/pith/AR3FTHCQCMX3DSLNT6CMXMATVG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AR3FTHCQCMX3DSLNT6CMXMATVG/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-02T13:04:43Z","links":{"resolver":"https://pith.science/pith/AR3FTHCQCMX3DSLNT6CMXMATVG","bundle":"https://pith.science/pith/AR3FTHCQCMX3DSLNT6CMXMATVG/bundle.json","state":"https://pith.science/pith/AR3FTHCQCMX3DSLNT6CMXMATVG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AR3FTHCQCMX3DSLNT6CMXMATVG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AR3FTHCQCMX3DSLNT6CMXMATVG","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":"b938f86f4bf34b086745b2eaec6830d0f07216556d566d77fb7cb50facdd2699","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-05T15:16:47Z","title_canon_sha256":"dd65497e285279c18120964b9cd9301f6806344dd5717efaec9a57ea1cbb8ccb"},"schema_version":"1.0","source":{"id":"1708.01777","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01777","created_at":"2026-05-18T00:38:33Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01777v1","created_at":"2026-05-18T00:38:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01777","created_at":"2026-05-18T00:38:33Z"},{"alias_kind":"pith_short_12","alias_value":"AR3FTHCQCMX3","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AR3FTHCQCMX3DSLN","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AR3FTHCQ","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:4b714d37fdf1e781e907d8bb12b994c801bf6d66ea85b74c10d105e0c9ad03d0","target":"graph","created_at":"2026-05-18T00:38:33Z","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 problem of when a given digraph contains a subdivision of a fixed digraph $F$ is considered. Bang-Jensen et al. laid out foundations for approaching this problem from the algorithmic point of view. In this paper we give further support to several open conjectures and speculations about algorithmic complexity of finding $F$-subdivisions. In particular, up to 5 exceptions, we completely classify for which 4-vertex digraphs $F$, the $F$-subdivision problem is polynomial-time solvable and for which it is NP-complete. While all NP-hardness proofs are made by reduction from some version of the 2","authors_text":"A. Karolinna Maia, Bojan Mohar, Fr\\'ed\\'eric Havet","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-05T15:16:47Z","title":"Finding a subdivision of a prescribed digraph of order 4"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01777","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:013e06cb83d504911318932f8526188c12c81d164df5b62d7fadc67dafc56219","target":"record","created_at":"2026-05-18T00:38:33Z","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":"b938f86f4bf34b086745b2eaec6830d0f07216556d566d77fb7cb50facdd2699","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-05T15:16:47Z","title_canon_sha256":"dd65497e285279c18120964b9cd9301f6806344dd5717efaec9a57ea1cbb8ccb"},"schema_version":"1.0","source":{"id":"1708.01777","kind":"arxiv","version":1}},"canonical_sha256":"0476599c50132fb1c96d9f84cbb013a98d213267c232a4ea2d64dc9917e7582b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0476599c50132fb1c96d9f84cbb013a98d213267c232a4ea2d64dc9917e7582b","first_computed_at":"2026-05-18T00:38:33.193743Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:33.193743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LZEScJFMorfWvazb2U4iA+reqsJQnPCWFXZRyrWJn1A7mTzipVVTUh/STloK0qg1MoNSuB6qe17eWAg1CN65AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:33.194235Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.01777","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:013e06cb83d504911318932f8526188c12c81d164df5b62d7fadc67dafc56219","sha256:4b714d37fdf1e781e907d8bb12b994c801bf6d66ea85b74c10d105e0c9ad03d0"],"state_sha256":"f7c7503e9ca66beb8eae1ef5a647bbb00b4653135c0ec5c942dc1c180102471f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9LzNdo8kYnJw6N0ErFT+CKegVyOWfwdS9tLW3HUIC6vvHAcUEzmJGJ2hcg26eSS/2vcCGTxyRkaTp4uN1/4VCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T13:04:43.919284Z","bundle_sha256":"8aa1c2975ceae3e5a56cb1c6bc14bb6bfd3025f97224d1bcf90e141f9e5e33eb"}}