{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:24435WAPSJ72RGYWKFAUFQZQDE","short_pith_number":"pith:24435WAP","canonical_record":{"source":{"id":"1708.06857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-08-23T00:18:44Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ddbba385623f75dbb801334228bfd4d297923981a1583e47b986e9ab30e503fc","abstract_canon_sha256":"356ebd8e32974a97f76b036d33954a6302ce3a9d5ee95340f1c2ea4e6474c426"},"schema_version":"1.0"},"canonical_sha256":"d739bed80f927fa89b16514142c3301910cd9cd3dbc82701aaeaf6f9f925cfdb","source":{"kind":"arxiv","id":"1708.06857","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06857","created_at":"2026-05-18T00:36:49Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06857v1","created_at":"2026-05-18T00:36:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06857","created_at":"2026-05-18T00:36:49Z"},{"alias_kind":"pith_short_12","alias_value":"24435WAPSJ72","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"24435WAPSJ72RGYW","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"24435WAP","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:24435WAPSJ72RGYWKFAUFQZQDE","target":"record","payload":{"canonical_record":{"source":{"id":"1708.06857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-08-23T00:18:44Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ddbba385623f75dbb801334228bfd4d297923981a1583e47b986e9ab30e503fc","abstract_canon_sha256":"356ebd8e32974a97f76b036d33954a6302ce3a9d5ee95340f1c2ea4e6474c426"},"schema_version":"1.0"},"canonical_sha256":"d739bed80f927fa89b16514142c3301910cd9cd3dbc82701aaeaf6f9f925cfdb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:49.028121Z","signature_b64":"TXgl5T0vztRMRszLNDU2dGC98OOythHAzCt5EXPIl/xQvt0olU3DLtzrp+gtU1v5J086ADhjl0IsLaGU9qyzBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d739bed80f927fa89b16514142c3301910cd9cd3dbc82701aaeaf6f9f925cfdb","last_reissued_at":"2026-05-18T00:36:49.027713Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:49.027713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.06857","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:36:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yfruFVs9msCTb3K+TO47/jXylA1wxb0gaypOET94PIBf8X1QkxBfiey4/szMocGLIDkDeJIcmA9tToxuz6I5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:37:55.980650Z"},"content_sha256":"73110f6090e307a293f26edfe7b5f6c2868dc394e56ec12a150c87346e69181a","schema_version":"1.0","event_id":"sha256:73110f6090e307a293f26edfe7b5f6c2868dc394e56ec12a150c87346e69181a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:24435WAPSJ72RGYWKFAUFQZQDE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Min-Max Theorems for Packing and Covering Odd $(u,v)$-trails","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Chaitanya Swamy, Sharat Ibrahimpur","submitted_at":"2017-08-23T00:18:44Z","abstract_excerpt":"We investigate the problem of packing and covering odd $(u,v)$-trails in a graph. A $(u,v)$-trail is a $(u,v)$-walk that is allowed to have repeated vertices but no repeated edges. We call a trail odd if the number of edges in the trail is odd. Let $\\nu(u,v)$ denote the maximum number of edge-disjoint odd $(u,v)$-trails, and $\\tau(u,v)$ denote the minimum size of an edge-set that intersects every odd $(u,v)$-trail.\n  We prove that $\\tau(u,v)\\leq 2\\nu(u,v)+1$. Our result is tight---there are examples showing that $\\tau(u,v)=2\\nu(u,v)+1$---and substantially improves upon the bound of $8$ obtaine"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06857","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:36:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k2SF5eMKNHCaIA1QwsRrPxBFY/obJf4jQMj83R70b7l4hzU7aI+xPqUYdk0CCclQcQrdDFQOdP61a3KeYT6oAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:37:55.981404Z"},"content_sha256":"42168d8619811ef409fb735ebda2762a41c0671486dadc174c0e4e69f67cb258","schema_version":"1.0","event_id":"sha256:42168d8619811ef409fb735ebda2762a41c0671486dadc174c0e4e69f67cb258"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/24435WAPSJ72RGYWKFAUFQZQDE/bundle.json","state_url":"https://pith.science/pith/24435WAPSJ72RGYWKFAUFQZQDE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/24435WAPSJ72RGYWKFAUFQZQDE/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-11T08:37:55Z","links":{"resolver":"https://pith.science/pith/24435WAPSJ72RGYWKFAUFQZQDE","bundle":"https://pith.science/pith/24435WAPSJ72RGYWKFAUFQZQDE/bundle.json","state":"https://pith.science/pith/24435WAPSJ72RGYWKFAUFQZQDE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/24435WAPSJ72RGYWKFAUFQZQDE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:24435WAPSJ72RGYWKFAUFQZQDE","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":"356ebd8e32974a97f76b036d33954a6302ce3a9d5ee95340f1c2ea4e6474c426","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-08-23T00:18:44Z","title_canon_sha256":"ddbba385623f75dbb801334228bfd4d297923981a1583e47b986e9ab30e503fc"},"schema_version":"1.0","source":{"id":"1708.06857","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06857","created_at":"2026-05-18T00:36:49Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06857v1","created_at":"2026-05-18T00:36:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06857","created_at":"2026-05-18T00:36:49Z"},{"alias_kind":"pith_short_12","alias_value":"24435WAPSJ72","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"24435WAPSJ72RGYW","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"24435WAP","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:42168d8619811ef409fb735ebda2762a41c0671486dadc174c0e4e69f67cb258","target":"graph","created_at":"2026-05-18T00:36:49Z","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 investigate the problem of packing and covering odd $(u,v)$-trails in a graph. A $(u,v)$-trail is a $(u,v)$-walk that is allowed to have repeated vertices but no repeated edges. We call a trail odd if the number of edges in the trail is odd. Let $\\nu(u,v)$ denote the maximum number of edge-disjoint odd $(u,v)$-trails, and $\\tau(u,v)$ denote the minimum size of an edge-set that intersects every odd $(u,v)$-trail.\n  We prove that $\\tau(u,v)\\leq 2\\nu(u,v)+1$. Our result is tight---there are examples showing that $\\tau(u,v)=2\\nu(u,v)+1$---and substantially improves upon the bound of $8$ obtaine","authors_text":"Chaitanya Swamy, Sharat Ibrahimpur","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-08-23T00:18:44Z","title":"Min-Max Theorems for Packing and Covering Odd $(u,v)$-trails"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06857","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:73110f6090e307a293f26edfe7b5f6c2868dc394e56ec12a150c87346e69181a","target":"record","created_at":"2026-05-18T00:36:49Z","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":"356ebd8e32974a97f76b036d33954a6302ce3a9d5ee95340f1c2ea4e6474c426","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-08-23T00:18:44Z","title_canon_sha256":"ddbba385623f75dbb801334228bfd4d297923981a1583e47b986e9ab30e503fc"},"schema_version":"1.0","source":{"id":"1708.06857","kind":"arxiv","version":1}},"canonical_sha256":"d739bed80f927fa89b16514142c3301910cd9cd3dbc82701aaeaf6f9f925cfdb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d739bed80f927fa89b16514142c3301910cd9cd3dbc82701aaeaf6f9f925cfdb","first_computed_at":"2026-05-18T00:36:49.027713Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:49.027713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TXgl5T0vztRMRszLNDU2dGC98OOythHAzCt5EXPIl/xQvt0olU3DLtzrp+gtU1v5J086ADhjl0IsLaGU9qyzBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:49.028121Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.06857","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73110f6090e307a293f26edfe7b5f6c2868dc394e56ec12a150c87346e69181a","sha256:42168d8619811ef409fb735ebda2762a41c0671486dadc174c0e4e69f67cb258"],"state_sha256":"7a6a8b5a9eab8d540b99a24083640c929244c1eb9923f39134fd41fc9ce8df02"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7iNdBIKBEAD+RRSLyOvyc5/GiYl3Uwo4xnMt7aNpAUqvAkNEt+q8VN1B1KHgykTe4jUVQ78I/5mSz6h6TcfUAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T08:37:55.985431Z","bundle_sha256":"01c6314c8e98e0012698ed9559278ba73963857186ce961bf969b24f6e115971"}}