{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:V45SS7KNLSJZUSCTYMF6H6PC4N","short_pith_number":"pith:V45SS7KN","schema_version":"1.0","canonical_sha256":"af3b297d4d5c939a4853c30be3f9e2e350b8f586911a7038a0a94f8cd3d28871","source":{"kind":"arxiv","id":"1806.08879","version":2},"attestation_state":"computed","paper":{"title":"A Note on Minimal Senders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nerio Borges","submitted_at":"2018-06-22T23:41:43Z","abstract_excerpt":"In this paper we prove that if a pair of graphs G,H have senders, then they necessarily have connected minimal senders; we also prove that given two fixed graphs that are either 3-connected or triangles there are minimal (G,H)-senders with arbitrarily distant signal edges and (G,H)-minimal graphs with arbitrarily large cycles, thus showing there is no upper bound for the diameters of (G,H)-minimal graphs."},"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":"1806.08879","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-22T23:41:43Z","cross_cats_sorted":[],"title_canon_sha256":"a032cb71f2e021637676baec1d9fb47f230b195eff8c72b6eeb7c34805992a98","abstract_canon_sha256":"c60b59f4ec03d04856d45faff504025a42504d89f1e40d07a179c9a352c2b4a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:46.531877Z","signature_b64":"1x4Ia6d++wmvOv+FxI0aU58RUJy/QOAsWJDDHfNqCGKh6N0QACAUDm+An19ErBhi+1maOyeoBpLgj9gtkAQmDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af3b297d4d5c939a4853c30be3f9e2e350b8f586911a7038a0a94f8cd3d28871","last_reissued_at":"2026-05-18T00:11:46.531148Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:46.531148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on Minimal Senders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nerio Borges","submitted_at":"2018-06-22T23:41:43Z","abstract_excerpt":"In this paper we prove that if a pair of graphs G,H have senders, then they necessarily have connected minimal senders; we also prove that given two fixed graphs that are either 3-connected or triangles there are minimal (G,H)-senders with arbitrarily distant signal edges and (G,H)-minimal graphs with arbitrarily large cycles, thus showing there is no upper bound for the diameters of (G,H)-minimal graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08879","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.08879","created_at":"2026-05-18T00:11:46.531276+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.08879v2","created_at":"2026-05-18T00:11:46.531276+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08879","created_at":"2026-05-18T00:11:46.531276+00:00"},{"alias_kind":"pith_short_12","alias_value":"V45SS7KNLSJZ","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"V45SS7KNLSJZUSCT","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"V45SS7KN","created_at":"2026-05-18T12:32:56.356000+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/V45SS7KNLSJZUSCTYMF6H6PC4N","json":"https://pith.science/pith/V45SS7KNLSJZUSCTYMF6H6PC4N.json","graph_json":"https://pith.science/api/pith-number/V45SS7KNLSJZUSCTYMF6H6PC4N/graph.json","events_json":"https://pith.science/api/pith-number/V45SS7KNLSJZUSCTYMF6H6PC4N/events.json","paper":"https://pith.science/paper/V45SS7KN"},"agent_actions":{"view_html":"https://pith.science/pith/V45SS7KNLSJZUSCTYMF6H6PC4N","download_json":"https://pith.science/pith/V45SS7KNLSJZUSCTYMF6H6PC4N.json","view_paper":"https://pith.science/paper/V45SS7KN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.08879&json=true","fetch_graph":"https://pith.science/api/pith-number/V45SS7KNLSJZUSCTYMF6H6PC4N/graph.json","fetch_events":"https://pith.science/api/pith-number/V45SS7KNLSJZUSCTYMF6H6PC4N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V45SS7KNLSJZUSCTYMF6H6PC4N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V45SS7KNLSJZUSCTYMF6H6PC4N/action/storage_attestation","attest_author":"https://pith.science/pith/V45SS7KNLSJZUSCTYMF6H6PC4N/action/author_attestation","sign_citation":"https://pith.science/pith/V45SS7KNLSJZUSCTYMF6H6PC4N/action/citation_signature","submit_replication":"https://pith.science/pith/V45SS7KNLSJZUSCTYMF6H6PC4N/action/replication_record"}},"created_at":"2026-05-18T00:11:46.531276+00:00","updated_at":"2026-05-18T00:11:46.531276+00:00"}