{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NDHUOMTAEGPOBJFUGZ2JHQHBHQ","short_pith_number":"pith:NDHUOMTA","schema_version":"1.0","canonical_sha256":"68cf473260219ee0a4b4367493c0e13c1d2ef81112922cbeab6d50f3e1f58041","source":{"kind":"arxiv","id":"1709.00824","version":1},"attestation_state":"computed","paper":{"title":"Making Bidirected Graphs Strongly Connected","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Shun Sato, Tatsuya Matsuoka","submitted_at":"2017-09-04T06:11:10Z","abstract_excerpt":"We consider problems to make a given bidirected graph strongly connected with minimum cardinality of additional signs or additional arcs. For the former problem, we show the minimum number of additional signs and give a linear-time algorithm for finding an optimal solution. For the latter problem, we give a linear-time algorithm for finding a feasible solution whose size is equal to the obvious lower bound or more than that by one."},"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":"1709.00824","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-09-04T06:11:10Z","cross_cats_sorted":[],"title_canon_sha256":"966ee714aa8f5ff1bc32a83755fb690050a94a2ab58f300801fe5f9779e2c9cc","abstract_canon_sha256":"8de0bbe349f1101681258e3b84484f993ba2d1bd3f574bbfa6dc18aa26ae3b1a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:05.028474Z","signature_b64":"e7844Rt3jo5FgJxtTWAc7MpnXNjMfrvYqLfzlSbCUMBdWHwyIe6HkAqi0w/eRCmJc79Fzxky3uMQs+1Lz8lsDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68cf473260219ee0a4b4367493c0e13c1d2ef81112922cbeab6d50f3e1f58041","last_reissued_at":"2026-05-18T00:36:05.027853Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:05.027853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Making Bidirected Graphs Strongly Connected","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Shun Sato, Tatsuya Matsuoka","submitted_at":"2017-09-04T06:11:10Z","abstract_excerpt":"We consider problems to make a given bidirected graph strongly connected with minimum cardinality of additional signs or additional arcs. For the former problem, we show the minimum number of additional signs and give a linear-time algorithm for finding an optimal solution. For the latter problem, we give a linear-time algorithm for finding a feasible solution whose size is equal to the obvious lower bound or more than that by one."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00824","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":"1709.00824","created_at":"2026-05-18T00:36:05.027940+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.00824v1","created_at":"2026-05-18T00:36:05.027940+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00824","created_at":"2026-05-18T00:36:05.027940+00:00"},{"alias_kind":"pith_short_12","alias_value":"NDHUOMTAEGPO","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"NDHUOMTAEGPOBJFU","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"NDHUOMTA","created_at":"2026-05-18T12:31:31.346846+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/NDHUOMTAEGPOBJFUGZ2JHQHBHQ","json":"https://pith.science/pith/NDHUOMTAEGPOBJFUGZ2JHQHBHQ.json","graph_json":"https://pith.science/api/pith-number/NDHUOMTAEGPOBJFUGZ2JHQHBHQ/graph.json","events_json":"https://pith.science/api/pith-number/NDHUOMTAEGPOBJFUGZ2JHQHBHQ/events.json","paper":"https://pith.science/paper/NDHUOMTA"},"agent_actions":{"view_html":"https://pith.science/pith/NDHUOMTAEGPOBJFUGZ2JHQHBHQ","download_json":"https://pith.science/pith/NDHUOMTAEGPOBJFUGZ2JHQHBHQ.json","view_paper":"https://pith.science/paper/NDHUOMTA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.00824&json=true","fetch_graph":"https://pith.science/api/pith-number/NDHUOMTAEGPOBJFUGZ2JHQHBHQ/graph.json","fetch_events":"https://pith.science/api/pith-number/NDHUOMTAEGPOBJFUGZ2JHQHBHQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NDHUOMTAEGPOBJFUGZ2JHQHBHQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NDHUOMTAEGPOBJFUGZ2JHQHBHQ/action/storage_attestation","attest_author":"https://pith.science/pith/NDHUOMTAEGPOBJFUGZ2JHQHBHQ/action/author_attestation","sign_citation":"https://pith.science/pith/NDHUOMTAEGPOBJFUGZ2JHQHBHQ/action/citation_signature","submit_replication":"https://pith.science/pith/NDHUOMTAEGPOBJFUGZ2JHQHBHQ/action/replication_record"}},"created_at":"2026-05-18T00:36:05.027940+00:00","updated_at":"2026-05-18T00:36:05.027940+00:00"}