{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:D6HTV6IAOLCLQFKOLGTTVXYXO2","short_pith_number":"pith:D6HTV6IA","canonical_record":{"source":{"id":"1702.03075","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-10T06:12:12Z","cross_cats_sorted":[],"title_canon_sha256":"2331dafeec5ffe080981c42dc8184258bd107d50c03ef73ae6b2c30e1cb6efc2","abstract_canon_sha256":"746b9af1b4cfd3cbc98b8f2cdcebf19ef95c1fe47638b063f314730ae298f1b6"},"schema_version":"1.0"},"canonical_sha256":"1f8f3af90072c4b8154e59a73adf1776a48aecf9634ab0590504b574f406278a","source":{"kind":"arxiv","id":"1702.03075","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.03075","created_at":"2026-05-18T00:17:19Z"},{"alias_kind":"arxiv_version","alias_value":"1702.03075v2","created_at":"2026-05-18T00:17:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03075","created_at":"2026-05-18T00:17:19Z"},{"alias_kind":"pith_short_12","alias_value":"D6HTV6IAOLCL","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"D6HTV6IAOLCLQFKO","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"D6HTV6IA","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:D6HTV6IAOLCLQFKOLGTTVXYXO2","target":"record","payload":{"canonical_record":{"source":{"id":"1702.03075","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-10T06:12:12Z","cross_cats_sorted":[],"title_canon_sha256":"2331dafeec5ffe080981c42dc8184258bd107d50c03ef73ae6b2c30e1cb6efc2","abstract_canon_sha256":"746b9af1b4cfd3cbc98b8f2cdcebf19ef95c1fe47638b063f314730ae298f1b6"},"schema_version":"1.0"},"canonical_sha256":"1f8f3af90072c4b8154e59a73adf1776a48aecf9634ab0590504b574f406278a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:19.614027Z","signature_b64":"nvu5xrdjCXLZQiATl5eK2a1qMBBCKIYkYnAMiPF2vNaL1ViP7sXUl7rkoOQ5J4cZuVlADhQvgZo76hEEMwKeBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f8f3af90072c4b8154e59a73adf1776a48aecf9634ab0590504b574f406278a","last_reissued_at":"2026-05-18T00:17:19.613530Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:19.613530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.03075","source_version":2,"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:17:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lchrGyNaWh/nAUfFynvSuOwbWbKCRAF5OadQKsmu57nw1KJSd0LfCene21s2Jh+catBemsavA9PIRcD0LwVHAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:10:17.131948Z"},"content_sha256":"f8935ba47ddc0e2115ece80b941b6d7e40cbf793d1975c33c047447af37a7a1f","schema_version":"1.0","event_id":"sha256:f8935ba47ddc0e2115ece80b941b6d7e40cbf793d1975c33c047447af37a7a1f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:D6HTV6IAOLCLQFKOLGTTVXYXO2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A construction for directed in-out subgraphs of optimal size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asghar Moeini, David Glynn, Michael Haythorpe","submitted_at":"2017-02-10T06:12:12Z","abstract_excerpt":"We discuss the recently introduced concept of k-in-out graphs, and provide a construction for k-in-out graphs for any positive integer k. We derive a lower bound for the number of vertices of a k-in-out graph for any positive integer k, and demonstrate that our construction meets this bound in all cases. For even k, we also prove our construction is optimal with respect to the number of edges, and results in a planar graph. Among the possible uses of in-out graphs, they can convert the generalized traveling salesman problem to the asymmetric traveling salesman problem, avoiding the \"big M\" iss"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03075","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"},"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:17:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ME3J0v+hJpL8Y+Oq/7tQHYsJgeXL3os9NSbTm6Gj1XYHcRY90Spdz+a/MBTNErvdPU6+QvSjYz0UeNeZkrOPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:10:17.132490Z"},"content_sha256":"f3c678e4eb2ab939006acb0e6902aae9e649ccec57d2a26afce227a4c62548ff","schema_version":"1.0","event_id":"sha256:f3c678e4eb2ab939006acb0e6902aae9e649ccec57d2a26afce227a4c62548ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D6HTV6IAOLCLQFKOLGTTVXYXO2/bundle.json","state_url":"https://pith.science/pith/D6HTV6IAOLCLQFKOLGTTVXYXO2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D6HTV6IAOLCLQFKOLGTTVXYXO2/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-31T03:10:17Z","links":{"resolver":"https://pith.science/pith/D6HTV6IAOLCLQFKOLGTTVXYXO2","bundle":"https://pith.science/pith/D6HTV6IAOLCLQFKOLGTTVXYXO2/bundle.json","state":"https://pith.science/pith/D6HTV6IAOLCLQFKOLGTTVXYXO2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D6HTV6IAOLCLQFKOLGTTVXYXO2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:D6HTV6IAOLCLQFKOLGTTVXYXO2","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":"746b9af1b4cfd3cbc98b8f2cdcebf19ef95c1fe47638b063f314730ae298f1b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-10T06:12:12Z","title_canon_sha256":"2331dafeec5ffe080981c42dc8184258bd107d50c03ef73ae6b2c30e1cb6efc2"},"schema_version":"1.0","source":{"id":"1702.03075","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.03075","created_at":"2026-05-18T00:17:19Z"},{"alias_kind":"arxiv_version","alias_value":"1702.03075v2","created_at":"2026-05-18T00:17:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03075","created_at":"2026-05-18T00:17:19Z"},{"alias_kind":"pith_short_12","alias_value":"D6HTV6IAOLCL","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"D6HTV6IAOLCLQFKO","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"D6HTV6IA","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:f3c678e4eb2ab939006acb0e6902aae9e649ccec57d2a26afce227a4c62548ff","target":"graph","created_at":"2026-05-18T00:17:19Z","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":"We discuss the recently introduced concept of k-in-out graphs, and provide a construction for k-in-out graphs for any positive integer k. We derive a lower bound for the number of vertices of a k-in-out graph for any positive integer k, and demonstrate that our construction meets this bound in all cases. For even k, we also prove our construction is optimal with respect to the number of edges, and results in a planar graph. Among the possible uses of in-out graphs, they can convert the generalized traveling salesman problem to the asymmetric traveling salesman problem, avoiding the \"big M\" iss","authors_text":"Asghar Moeini, David Glynn, Michael Haythorpe","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-10T06:12:12Z","title":"A construction for directed in-out subgraphs of optimal size"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03075","kind":"arxiv","version":2},"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:f8935ba47ddc0e2115ece80b941b6d7e40cbf793d1975c33c047447af37a7a1f","target":"record","created_at":"2026-05-18T00:17:19Z","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":"746b9af1b4cfd3cbc98b8f2cdcebf19ef95c1fe47638b063f314730ae298f1b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-10T06:12:12Z","title_canon_sha256":"2331dafeec5ffe080981c42dc8184258bd107d50c03ef73ae6b2c30e1cb6efc2"},"schema_version":"1.0","source":{"id":"1702.03075","kind":"arxiv","version":2}},"canonical_sha256":"1f8f3af90072c4b8154e59a73adf1776a48aecf9634ab0590504b574f406278a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f8f3af90072c4b8154e59a73adf1776a48aecf9634ab0590504b574f406278a","first_computed_at":"2026-05-18T00:17:19.613530Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:19.613530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nvu5xrdjCXLZQiATl5eK2a1qMBBCKIYkYnAMiPF2vNaL1ViP7sXUl7rkoOQ5J4cZuVlADhQvgZo76hEEMwKeBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:19.614027Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.03075","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8935ba47ddc0e2115ece80b941b6d7e40cbf793d1975c33c047447af37a7a1f","sha256:f3c678e4eb2ab939006acb0e6902aae9e649ccec57d2a26afce227a4c62548ff"],"state_sha256":"c2e188c60019c827e27156ebd7b6505bd4903ec1c69149810ef46d83ca89bfb2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Yk6CfsHWcLjAl7wQFhSEjMa9iukEKPWzggaW/rjYxS4bULUI0m6SspaVUn6SxLkQm4rjg9Gx+Ubc8L1scibCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:10:17.135134Z","bundle_sha256":"5d1aab5e3080eb3a3b3965db74b85aa40f7a142483a6d147a967f41de1a17dd5"}}